On Algebraic Expressions of Generalized Fibonacci Graphs
|
|
- Eric McDaniel
- 6 years ago
- Views:
Transcription
1 On Algebraic Expressions of Generalized Fibonacci Graphs MARK KORENBLIT and VADIM E LEVIT Department of Computer Science Holon Academic Institute of Technology 5 Golomb Str, PO Box 305, Holon 580 ISRAEL {korenblit, levitv}@haitacil Abstract: - The paper investigates relationship between algebraic expressions and generalized Fibonacci graphs We propose an algorithm for constructing expressions of generalized Fibonacci graphs On every step it divides the graph into two parts of the same size We show that this algorithm applied to an n-vertex log ( k + ) generalized Fibonacci graph of degree k generates an expression of O ( n ) k length When k equals, O n length the algorithm generates expressions of Key-Words: - complexity of an algebraic expression, generalized Fibonacci graph, optimal representation of the algebraic expression, st-dag, st-dag expression, subexpression, subgraph Introduction A graph G=(V,E) consists of a vertex set V and an edge set E, where each edge corresponds to a pair (v,w) of vertices If the edges are ordered pairs of vertices (ie, the pair (v,w) is different from the pair (v,w), then we call the graph directed or digraph; otherwise, we call it undirected A path from vertex v 0 to vertex v j in a graph G=(V,E) is a sequence of its vertices v 0, v, v,, v j, v j, such that (v i,v i ) E for i j A graph G =(V,E ) is a subgraph of G=(V,E) if V V and E E A graph G is homeomorphic to a graph G (homeomorph of G ) if G can be obtained by subdividing edges of G via adding new vertices A two-terminal directed acyclic graph (st-dag) has only one source s and only one sink t In an st-dag, every vertex lies on some path from the source to the sink An st-dag that has only one path between the source and the sink is known as a path graph A complete graph is an undirected graph that has an edge between any two vertices An algebraic expression is called an st-dag expression if it is algebraically equivalent to the sum of products corresponding to all possible paths between the source and the sink of the st-dag [] This expression consists of terms (edge labels), and the operators + (disjoint union) and (concatenation, also denoted by juxtaposition when no ambiguity arises) An st-dag expression of an st-dag G will be further denoted by Ex(G) We define the complexity of an algebraic expression in two ways The complexity of an algebraic expression is (i) a total number of terms in the expression including all their appearances (the first complexity characteristic) or (ii) a number of plus operators in the expression (the second complexity characteristic) The first and the second complexity characteristics of an st-dag expression are denoted by T(n) and P(n) respectively, where n is the number of vertices of the graph (the size of the graph) An equivalent expression with the minimum complexity is called an optimal representation of the algebraic expression A series-parallel (SP) graph is defined recursively as follows: (i) A single edge (u,v) is a series-parallel graph with source u and sink v (ii) If G and G are series-parallel graphs, so is the graph obtained by either of the following operations: (a) Parallel composition: identify the source of G with the source of G and the sink of G with the sink of G (b) Series composition: identify the sink of G with the source of G As shown in [] and [7], a SP graph expression has a representation in which each term appears only once We proved in [7] that this representation is an optimal representation of the SP graph expression from the first complexity characteristic point of view For example, the expression of the SP graph presented in Fig is abd+abe+acd+ace+fe+fd a f b c Fig A series-parallel graph d e
2 b b b i b i+ b n a a 3 a a i a i+ a i+ a n 3 i i+ i+ n n Fig An n-vertex Fibonacci graph This expression can be reduced to (a(b+c)+f)(d+e), where each term appears once The notion of a Fibonacci graph (FG) was introduced in [6] A Fibonacci graph has vertices {,, 3,, n} and edges {(v,v+) v=,,,n } U {(v,v+) v=,,,n } That is, in an n-vertex FG (n ), two edges leave each of its n vertices except the two final vertices (n and n) Two edges leaving the v vertex ( v n ) enter the v+ and the v+ vertices The single edge leaving the n vertex enters the n vertex No edge leaves the n vertex This graph is illustrated in Fig A generalized Fibonacci graph [6] of degree k (FG k ) has vertices {,, 3,, n} and edges FG a {(v,w) v < w n and w v k} FG a a a 3 a 4 a b b b 3 b 4 a a 3 a FG 3 b b b 3 b 4 a c c a a 3 a c 3 Fig3 The hierarchy of generalized 6-vertex Fibonacci graphs a 5 a That is, in an n-vertex FG k (n k), k edges leave each of its n vertices except the k final vertices (n k+, n k+,, n, n); k edges leaving the v vertex ( v n k) enter the v+, the v+,, the v+k vertices respectively; k edges leaving the n k+ vertex enter the n k+, the n k+3,, the n vertices respectively; k edges leaving the n k+ vertex enter the n k+3, the n k+4,, the n vertices respectively, etc; the single edge leaving the n vertex enters the n vertex; no edge leaves the n vertex Fig 3 presents the hierarchy of 6-vertex generalized Fibonacci graphs FG is a path graph (it is a SP graph) The Fibonacci graph defined above is FG The next graph is FG 3 FG n is the last nontrivial graph in the hierarchy of n-vertex generalized Fibonacci graphs (its undirected version is a complete graph) Hence, for n = 6 it is FG 5 (this graph is not shown in Fig 3) As shown in [6], an n-vertex FG k has k( k +) m = kn edges It is proved in [3] that an st-dag is SP if and only if it does not contain a subgraph homeomorphic to the forbidden subgraph enclosed between vertices and 4 of an FG from Fig Thus, generalized Fibonacci graphs (k ) are of interest as ''through'' non-sp st-dags Mutual relations between graphs and algebraic expressions are discussed in [], [7], [8], [9], [0], [], [], [3], and other works Specifically, [0], [], and [3] consider the correspondence between SP graphs and read-once functions A Boolean function is defined as read-once if it may be computed by some formula in which no variable occurs more than once (read-once formula) On the other hand, a SP graph expression can be reduced to the representation in which each term appears only once Hence, such a representation of a SP graph expression can be interpreted as a read-once formula (Boolean operations are replaced by arithmetic ones) An expression of a homeomorph of the forbidden subgraph belonging to any non-sp st-dag has no representation in which each term appears once For example, consider the subgraph enclosed between vertices and 4 of an FG from Fig Possible
3 optimal representations of its expression are a (a a 3 +b )+b a 3 or (a a +b )a 3 +a b For this reason, an expression of a non-sp st-dag can not be represented as a read-once formula However, for arbitrary functions, which are not read-once, generating the optimum factored form is NPcomplete [4] Some heuristic algorithms developed in order to obtain good factored forms are described in [4], [5], and other works Therefore, generating an optimal representation (from both complexity characteristics point of view) for a non-sp st-dag expression is a highly complex problem In [9] we presented a heuristic algorithm based on the decomposition method built to simplify the expressions of FG While [7] is a substantially improved version of [9], in [9], [7] we show that complexity characteristics of an n-vertex FG can be estimated as O ( n ) Our intent in this paper is to simplify the expressions of FG k for an arbitrary k The Decomposition Method for Constructing Expressions of Generalized Fibonacci Graphs of Degree In this section we sketch some of the results received in [9], [7] Consider the n-vertex FG presented in Fig Denote by E(p,q) a subexpression related to its subgraph (which is an FG too) having a source p ( p n) and a sink q ( q n, q p) If q p, then we choose any decomposition vertex i (p + i q ) in a subgraph, and, in effect, split it at this vertex (Fig 4) Otherwise, we assign final values to E(p,q) As follows from the FG structure any path from vertex p to vertex q passes through vertex i or avoids it via edge b i- Therefore, E(p,q) is generated by the following recursive procedure (decomposition procedure): case q = p: E(p,q) case q = p + : E(p,q) a p 3 case q p + : choice(p,q,i) 4 E(p,q) E(p,i)E(i,q)+ E(p,i )b i- E(i+,q) Lines and contain conditions of exit from the recursion The special case when a subgraph consists of a single vertex is considered in line It is clear that such a subgraph can be connected to other subgraphs only serially For this reason, it is accepted that its subexpression is, so that when it is multiplied by another subexpression, the final result is not influenced Line describes a subgraph consisting of a single edge The corresponding subexpression consists of a single term equal to the edge label The common case is processed in lines 3 and 4 The procedure choice(p,q,i) in line 3 chooses an arbitrary decomposition vertex i on the interval (p,q) so that p < i < q A current subgraph is decomposed into four new subgraphs in line 4 Subgraphs described by subexpressions E(p,i) and E(i,q) include all paths from vertex p to vertex q passing through vertex i Subgraphs described by subexpressions E(p,i ) and E(i+,q) include all paths from vertex p to vertex q passing via edge b i- E(,n) is the expression of the initial n-vertex FG (Ex(FG )) Hence, the decomposition procedure is initially invoked by substituting parameters and n instead of p and q, respectively The following theorem that determines an optimal location of the decomposition vertex i in an arbitrary interval (p,q) of a Fibonacci graph is proved in [7] Theorem The representation with a minimum total number of terms among all possible representations of Ex(FG ) derived by the decomposition method is achieved if and only if on q p + each recursive step i is equal to for odd q p + q p + 3 q p+ and to or for even q p+, ie, when i is a middle vertex of the interval (p,q) This decomposition method is called optimal It can be shown that the optimal decomposition method also brings about the minimum to the number of plus operators of Ex(FG ) Thus, the total number of terms in the n-vertex FG expression derived by the optimal decomposition method is defined recursively as follows: b p b i b q a p a i p p+ i i i+ q q Fig4 Decomposition of a Fibonacci subgraph at vertex i 3 a i a q
4 T () = 0, T () = n = T T n n T + +, 3 T n The number of plus operators in this expression is defined similarly: and P() = 0, P() = 0 n P( n) = P P For large n n n P + +, 3 P n 4T + P ( n) 4P + By the master theorem [] the recurrence as n = αt + f ( n), β n where α and β > are constants, and is β n interpreted as either or β asymptotically as follows: n, can be bounded β = Θ n log α ε if β ( n) = O n α log β f for some constant ε > 0 Θ For the 8-vertex FG, the possible expression derived by the optimal decomposition method is Therefore, T(n) and P(n) are ( n ) (a (a a 3 +b )+b a 3 )((a 4 a 5 +b 4 )(a 6 a 7 +b 6 )+a 4 b 5 a 7 )+ (a a +b )b 3 (a 5 (a 6 a 7 +b 6 )+b 5 a 7 ) It contains 5 terms and 9 plus operators We conjecture that the optimal decomposition method provides an optimal representation (for both our complexity characteristics) of an algebraic expression of a Fibonacci graph 3 The Decomposition Method for Constructing Expressions of Generalized Fibonacci Graphs of Arbitrary Degrees We intend to generate an algebraic expression for FG k and apply the decomposition method with that end in view The method is the decomposition method described in the previous section extended for a generalized Fibonacci graph We consider the n-vertex FG k (k ) and, as in section, denote by E(p,q) a subexpression related to its subgraph (which is FG k too) having a source p ( p n) and a sink q ( q n, q p) If q p (k ), then we choose any decomposition vertex i (p + k i q k + ) in a subgraph and split it at this vertex Otherwise, we assign final values to E(p,q) Any path from vertex p to vertex q passes through vertex i or avoids it via connecting edges (labeled b, c, d, with indexes) For example, as follows from the FG 3 structure (Fig 5) any path from vertex p to vertex q passes through decomposition vertex i or avoids it via connecting edges: b i-, c i- or c i- Therefore, E(p,q) can be generated for FG 3 by the following c p c i c i c q 3 b p b i b q a p a i p p+ i i i+ q q Fig5 Decomposition of a generalized Fibonacci subgraph of degree 3 at vertex i a i a q 4
5 decomposition procedure: case q = p: E(p,q) case q = p + : E(p,q) a p 3 case q = p + : E(p,q) a p a p+ +b p 4 case q = p + 3: E(p,q) (a p a p+ +b p )a p+ + a p b p+ +c p 5 case q p + 4: choice(p,q,i) 6 E(p,q) E(p,i)E(i,q)+ E(p,i )b i- E(i+,q)+ E(p,i )c i- E(i+,q)+ E(p,i )c i- E(i+,q) For an arbitrary k (k ), the number of connecting edges increases as an arithmetical progression from level to level (b-edges are located on the second level, c-edges are located on the third one, etc) Hence, the number of subgraphs revealed after the decomposition is equal to k + y= y = k k + The number of connecting edges and the number of additional plus operators between parts of the derived expression are equal to k y= k y = ( k ) We will choose the decomposition vertex i in the middle of a decomposed subgraph on each recursive step (we proceed from the supposition that it is the best way not only for k = but for any k and, also, call this decomposition method optimal) In such a case, for an n-vertex FG k, the total number of terms T(n) in the expression Ex(FG k ) derived by the optimal decomposition method can be estimated as follows: T n k k + T + k k Analogously, for an n-vertex FG k, the number of plus operators P(n) in the expression Ex(FG k ) derived by the optimal decomposition method can be estimated as follows: P k k n k k + P + Hence, by the master theorem and log ( k k + n = O n ) T () log ( k k + n = O n ) P () Specifically, for k =, when our graph is a path graph, () and () give O(n) For k = we have a O n complexity Fibonacci graph, and receive 3 Substituting 3 for k in () and () gives ( n ) O Further increase of k leads to slower increase of the order of complexity characteristics For instance, for log 4 O n, ie, less than k = 4, T(n) and P(n) are 4 O ( n ) 4 Conclusion and Future Work The paper investigates relationship between algebraic expressions and generalized Fibonacci graphs The optimal decomposition method applied to an n-vertex generalized Fibonacci graph of degree log ( k k + ) k (FG k ) generates an expression of O ( n ) complexity This result is a generalization of a previous result received for an n-vertex Fibonacci graph (FG ), where complexity characteristics are estimated as O ( n ) We conjecture that splitting of FG k in the middle of a decomposed subgraph on each recursive step yields the shortest expression possible (as in Theorem, where k equals two) Our experimental calculations show that the order of complexity characteristics of an n-vertex complete st-dag (FG n ) does not exceed n log n Based on the fact that any n-vertex st-dag (a two-terminal directed acyclic graph) is a subgraph of an n-vertex complete st-dag we are going to estimate the complexity of the shortest expression for any st-dag References: [] W W Bein, J Kamburowski, and M F M Stallmann, Optimal Reduction of Two-Terminal Directed Acyclic Graphs, SIAM Journal of Computing, Vol, No 6, 99, pp -9 [] T H Cormen, C E Leiseron, and R L Rivest, Introduction to Algorithms, The MIT Press, Cambridge, Massachusetts, 994 5
6 [3] R J Duffin, Topology of Series-Parallel Networks, Journal of Mathematical Analysis and Applications 0, 965, pp [4] M C Golumbic and A Mintz, Factoring Logic Functions Using Graph Partitioning, Proc IEEE/ACM Int Conf Computer Aided Design, November 999, San Jose, California, USA, pp [5] M C Golumbic, A Mintz, and U Rotics, Factoring and Recognition of Read-Once Functions using Cographs and Normality, Proc 38th Design Automation Conference, Las Vegas, Nevada, USA, June 00, pp 09-4 [6] M C Golumbic and Y Perl, Generalized Fibonacci Maximum Path Graphs, Discrete Mathematics 8, 979, pp [7] M Korenblit and V E Levit, On Algebraic Expressions of Series-Parallel and Fibonacci Graphs, in: Discrete Mathematics and Theoretical Computer Science, Proc 4th Int Conf, DMTCS 003, LNCS 73, 003, pp 5-4 [8] V E Levit and M Korenblit, Symbolic PERT and its Generalization, in: Intelligent Scheduling of Robots and Flexible Manufacturing Systems, Proc Int Workshop held at the Center for Technological Education Holon, Holon, Israel, July 995, pp [9] V E Levit and M Korenblit, A Symbolic Approach to Scheduling of Robotics Lines, in: Intelligent Scheduling of Robots and Flexible Manufacturing Systems, The Center for Technological Education Holon, Holon, Israel, 996, pp 3-5 [0] D Mundici, Functions Computed by Monotone Boolean Formulas with no Repeated Variables, Theoretical Computer Science 66, 989, pp 3-4 [] D Mundici, Solution of Rota s Problem on the Order of Series-Parallel Networks, Advances in Applied Mathematics, 99, pp [] V Naumann, Measuring the Distance to Series-Parallelity by Path Expressions, in: Graph-Theoretic Concepts in Computer Science, Proc 0th Int Workshop, WG 94, LNCS 903, 994, pp 69-8 [3] P Savicky and A R Woods, The Number of Boolean Functions Computed by Formulas of a Given Size, Random Structures and Algorithms 3, 998, pp [4] A R R Wang, Algorithms for Multilevel Logic Optimization, PhD Thesis, University of California, Berkeley, 989 6
arxiv: v1 [cs.ds] 12 May 2013
Full Square Rhomboids and Their Algebraic Expressions Mark Korenblit arxiv:105.66v1 [cs.ds] 1 May 01 Holon Institute of Technology, Israel korenblit@hit.ac.il Abstract. The paper investigates relationship
More informationAcyclic Subgraphs of Planar Digraphs
Acyclic Subgraphs of Planar Digraphs Noah Golowich Research Science Institute Department of Mathematics Massachusetts Institute of Technology Cambridge, Massachusetts, U.S.A. ngolowich@college.harvard.edu
More informationA Reduction of Conway s Thrackle Conjecture
A Reduction of Conway s Thrackle Conjecture Wei Li, Karen Daniels, and Konstantin Rybnikov Department of Computer Science and Department of Mathematical Sciences University of Massachusetts, Lowell 01854
More informationRead-Once Functions (Revisited) and the Readability Number of a Boolean Function. Martin Charles Golumbic
Read-Once Functions (Revisited) and the Readability Number of a Boolean Function Martin Charles Golumbic Caesarea Rothschild Institute University of Haifa Joint work with Aviad Mintz and Udi Rotics Outline
More informationThe Encoding Complexity of Network Coding
The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network
More informationVertex 3-colorability of claw-free graphs
Algorithmic Operations Research Vol.2 (27) 5 2 Vertex 3-colorability of claw-free graphs Marcin Kamiński a Vadim Lozin a a RUTCOR - Rutgers University Center for Operations Research, 64 Bartholomew Road,
More informationA GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY
A GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY KARL L. STRATOS Abstract. The conventional method of describing a graph as a pair (V, E), where V and E repectively denote the sets of vertices and edges,
More informationOdd Harmonious Labeling of Some Graphs
International J.Math. Combin. Vol.3(0), 05- Odd Harmonious Labeling of Some Graphs S.K.Vaidya (Saurashtra University, Rajkot - 360005, Gujarat, India) N.H.Shah (Government Polytechnic, Rajkot - 360003,
More informationComplexity Results on Graphs with Few Cliques
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 9, 2007, 127 136 Complexity Results on Graphs with Few Cliques Bill Rosgen 1 and Lorna Stewart 2 1 Institute for Quantum Computing and School
More information2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006
2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006 The Encoding Complexity of Network Coding Michael Langberg, Member, IEEE, Alexander Sprintson, Member, IEEE, and Jehoshua Bruck,
More informationCS473-Algorithms I. Lecture 13-A. Graphs. Cevdet Aykanat - Bilkent University Computer Engineering Department
CS473-Algorithms I Lecture 3-A Graphs Graphs A directed graph (or digraph) G is a pair (V, E), where V is a finite set, and E is a binary relation on V The set V: Vertex set of G The set E: Edge set of
More informationEnumeration of Full Graphs: Onset of the Asymptotic Region. Department of Mathematics. Massachusetts Institute of Technology. Cambridge, MA 02139
Enumeration of Full Graphs: Onset of the Asymptotic Region L. J. Cowen D. J. Kleitman y F. Lasaga D. E. Sussman Department of Mathematics Massachusetts Institute of Technology Cambridge, MA 02139 Abstract
More informationDefinition For vertices u, v V (G), the distance from u to v, denoted d(u, v), in G is the length of a shortest u, v-path. 1
Graph fundamentals Bipartite graph characterization Lemma. If a graph contains an odd closed walk, then it contains an odd cycle. Proof strategy: Consider a shortest closed odd walk W. If W is not a cycle,
More informationThese notes present some properties of chordal graphs, a set of undirected graphs that are important for undirected graphical models.
Undirected Graphical Models: Chordal Graphs, Decomposable Graphs, Junction Trees, and Factorizations Peter Bartlett. October 2003. These notes present some properties of chordal graphs, a set of undirected
More informationConnectivity check in 3-connected planar graphs with obstacles
Electronic Notes in Discrete Mathematics 31 (2008) 151 155 www.elsevier.com/locate/endm Connectivity check in 3-connected planar graphs with obstacles Bruno Courcelle a,1,2,3, Cyril Gavoille a,1,3, Mamadou
More informationCOLORING EDGES AND VERTICES OF GRAPHS WITHOUT SHORT OR LONG CYCLES
Volume 2, Number 1, Pages 61 66 ISSN 1715-0868 COLORING EDGES AND VERTICES OF GRAPHS WITHOUT SHORT OR LONG CYCLES MARCIN KAMIŃSKI AND VADIM LOZIN Abstract. Vertex and edge colorability are two graph problems
More informationOn the Balanced Case of the Brualdi-Shen Conjecture on 4-Cycle Decompositions of Eulerian Bipartite Tournaments
Electronic Journal of Graph Theory and Applications 3 (2) (2015), 191 196 On the Balanced Case of the Brualdi-Shen Conjecture on 4-Cycle Decompositions of Eulerian Bipartite Tournaments Rafael Del Valle
More informationLecture 22 Tuesday, April 10
CIS 160 - Spring 2018 (instructor Val Tannen) Lecture 22 Tuesday, April 10 GRAPH THEORY Directed Graphs Directed graphs (a.k.a. digraphs) are an important mathematical modeling tool in Computer Science,
More informationCounting the Number of Eulerian Orientations
Counting the Number of Eulerian Orientations Zhenghui Wang March 16, 011 1 Introduction Consider an undirected Eulerian graph, a graph in which each vertex has even degree. An Eulerian orientation of the
More informationMinimum Tree Spanner Problem for Butterfly and Benes Networks
Minimum Tree Spanner Problem for Butterfly and Benes Networks Bharati Rajan, Indra Rajasingh, Department of Mathematics, Loyola College, Chennai 600 0, India Amutha A Department of Mathematics, Loyola
More informationLecture 9 - Matrix Multiplication Equivalences and Spectral Graph Theory 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanfordedu) February 6, 2018 Lecture 9 - Matrix Multiplication Equivalences and Spectral Graph Theory 1 In the
More informationUML CS Algorithms Qualifying Exam Spring, 2004 ALGORITHMS QUALIFYING EXAM
NAME: This exam is open: - books - notes and closed: - neighbors - calculators ALGORITHMS QUALIFYING EXAM The upper bound on exam time is 3 hours. Please put all your work on the exam paper. (Partial credit
More informationSpeed-up of Parallel Processing of Divisible Loads on k-dimensional Meshes and Tori
The Computer Journal, 46(6, c British Computer Society 2003; all rights reserved Speed-up of Parallel Processing of Divisible Loads on k-dimensional Meshes Tori KEQIN LI Department of Computer Science,
More informationReachability in K 3,3 -free and K 5 -free Graphs is in Unambiguous Logspace
CHICAGO JOURNAL OF THEORETICAL COMPUTER SCIENCE 2014, Article 2, pages 1 29 http://cjtcs.cs.uchicago.edu/ Reachability in K 3,3 -free and K 5 -free Graphs is in Unambiguous Logspace Thomas Thierauf Fabian
More informationAcyclic orientations of graphs
Acyclic orientations of graphs Celia Glass and Peter Cameron CSG, 23 March 2012 Thanks to Jo Ellis-Monaghan for the following: Thanks to Jo Ellis-Monaghan for the following: Early Mathematics--Arithmetic
More informationReverse Polish notation in constructing the algorithm for polygon triangulation
Reverse Polish notation in constructing the algorithm for polygon triangulation Predrag V. Krtolica, Predrag S. Stanimirović and Rade Stanojević Abstract The reverse Polish notation properties are used
More informationAn Optimal Algorithm for the Indirect Covering Subtree Problem
An Optimal Algorithm for the Indirect Covering Subtree Problem Joachim Spoerhase Lehrstuhl für Informatik I, Universität Würzburg, Am Hubland, 97074 Würzburg, Germany Key words: Graph algorithm, coverage,
More informationAcyclic Colorings of Graph Subdivisions
Acyclic Colorings of Graph Subdivisions Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides, and Md. Saidur Rahman 3 Department of Computer Science, University of Manitoba Department of Computer Science,
More informationDHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI
DHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI Department of Computer Science and Engineering CS6702 - GRAPH THEORY AND APPLICATIONS Anna University 2 & 16 Mark Questions & Answers Year / Semester: IV /
More informationMinimal Dominating Sets in Graphs: Enumeration, Combinatorial Bounds and Graph Classes
Minimal Dominating Sets in Graphs: Enumeration, Combinatorial Bounds and Graph Classes J.-F. Couturier 1 P. Heggernes 2 D. Kratsch 1 P. van t Hof 2 1 LITA Université de Lorraine F-57045 Metz France 2 University
More informationGeneralized Pebbling Number
International Mathematical Forum, 5, 2010, no. 27, 1331-1337 Generalized Pebbling Number A. Lourdusamy Department of Mathematics St. Xavier s College (Autonomous) Palayamkottai - 627 002, India lourdugnanam@hotmail.com
More informationThomas H. Cormen Charles E. Leiserson Ronald L. Rivest. Introduction to Algorithms
Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Introduction to Algorithms Preface xiii 1 Introduction 1 1.1 Algorithms 1 1.2 Analyzing algorithms 6 1.3 Designing algorithms 1 1 1.4 Summary 1 6
More informationCMPSCI 311: Introduction to Algorithms Practice Final Exam
CMPSCI 311: Introduction to Algorithms Practice Final Exam Name: ID: Instructions: Answer the questions directly on the exam pages. Show all your work for each question. Providing more detail including
More informationCharacterizing Graphs (3) Characterizing Graphs (1) Characterizing Graphs (2) Characterizing Graphs (4)
S-72.2420/T-79.5203 Basic Concepts 1 S-72.2420/T-79.5203 Basic Concepts 3 Characterizing Graphs (1) Characterizing Graphs (3) Characterizing a class G by a condition P means proving the equivalence G G
More informationProvably Efficient Non-Preemptive Task Scheduling with Cilk
Provably Efficient Non-Preemptive Task Scheduling with Cilk V. -Y. Vee and W.-J. Hsu School of Applied Science, Nanyang Technological University Nanyang Avenue, Singapore 639798. Abstract We consider the
More informationarxiv: v2 [cs.dm] 30 May 2008
arxiv:0805.3901v2 [cs.dm] 30 May 2008 Properly Coloured Cycles and Paths: Results and Open Problems Gregory Gutin Eun Jung Kim Abstract In this paper, we consider a number of results and seven conjectures
More informationIntroduction to Algorithms Third Edition
Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein Introduction to Algorithms Third Edition The MIT Press Cambridge, Massachusetts London, England Preface xiü I Foundations Introduction
More informationOn the Max Coloring Problem
On the Max Coloring Problem Leah Epstein Asaf Levin May 22, 2010 Abstract We consider max coloring on hereditary graph classes. The problem is defined as follows. Given a graph G = (V, E) and positive
More informationOn Sequential Topogenic Graphs
Int. J. Contemp. Math. Sciences, Vol. 5, 2010, no. 36, 1799-1805 On Sequential Topogenic Graphs Bindhu K. Thomas, K. A. Germina and Jisha Elizabath Joy Research Center & PG Department of Mathematics Mary
More informationPacking Edge-Disjoint Triangles in Given Graphs
Electronic Colloquium on Computational Complexity, Report No. 13 (01) Packing Edge-Disjoint Triangles in Given Graphs Tomás Feder Carlos Subi Abstract Given a graph G, we consider the problem of finding
More informationGeneralized Interlinked Cycle Cover for Index Coding
Generalized Interlinked Cycle Cover for Index Coding Chandra Thapa, Lawrence Ong, and Sarah J. Johnson School of Electrical Engineering and Computer Science, The University of Newcastle, Newcastle, Australia
More informationThe competition numbers of complete tripartite graphs
The competition numbers of complete tripartite graphs SUH-RYUNG KIM Department of Mathematics Education, Seoul National University, 151-742, Korea srkim@snuackr YOSHIO SANO Research Institute for Mathematical
More informationAn Effective Upperbound on Treewidth Using Partial Fill-in of Separators
An Effective Upperbound on Treewidth Using Partial Fill-in of Separators Boi Faltings Martin Charles Golumbic June 28, 2009 Abstract Partitioning a graph using graph separators, and particularly clique
More informationContracting Chordal Graphs and Bipartite Graphs to Paths and Trees
Contracting Chordal Graphs and Bipartite Graphs to Paths and Trees Pinar Heggernes Pim van t Hof Benjamin Léveque Christophe Paul Abstract We study the following two graph modification problems: given
More informationHeuristic Algorithms for Multiconstrained Quality-of-Service Routing
244 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL 10, NO 2, APRIL 2002 Heuristic Algorithms for Multiconstrained Quality-of-Service Routing Xin Yuan, Member, IEEE Abstract Multiconstrained quality-of-service
More informationAdvanced algorithms. topological ordering, minimum spanning tree, Union-Find problem. Jiří Vyskočil, Radek Mařík 2012
topological ordering, minimum spanning tree, Union-Find problem Jiří Vyskočil, Radek Mařík 2012 Subgraph subgraph A graph H is a subgraph of a graph G, if the following two inclusions are satisfied: 2
More information1 Digraphs. Definition 1
1 Digraphs Definition 1 Adigraphordirected graphgisatriplecomprisedofavertex set V(G), edge set E(G), and a function assigning each edge an ordered pair of vertices (tail, head); these vertices together
More informationAs an example of possible application we compute these invariants for connectome graphs which are studied in neuroscience.
STRONG CONNECTIVITY AND ITS APPLICATIONS arxiv:1609.07355v2 [cs.dm] 20 Oct 2016 PETERIS DAUGULIS Abstract. Directed graphs are widely used in modelling of nonsymmetric relations in various sciences and
More informationInterleaving Schemes on Circulant Graphs with Two Offsets
Interleaving Schemes on Circulant raphs with Two Offsets Aleksandrs Slivkins Department of Computer Science Cornell University Ithaca, NY 14853 slivkins@cs.cornell.edu Jehoshua Bruck Department of Electrical
More informationMA651 Topology. Lecture 4. Topological spaces 2
MA651 Topology. Lecture 4. Topological spaces 2 This text is based on the following books: Linear Algebra and Analysis by Marc Zamansky Topology by James Dugundgji Fundamental concepts of topology by Peter
More informationThe strong chromatic number of a graph
The strong chromatic number of a graph Noga Alon Abstract It is shown that there is an absolute constant c with the following property: For any two graphs G 1 = (V, E 1 ) and G 2 = (V, E 2 ) on the same
More informationMinimum Cost Edge Disjoint Paths
Minimum Cost Edge Disjoint Paths Theodor Mader 15.4.2008 1 Introduction Finding paths in networks and graphs constitutes an area of theoretical computer science which has been highly researched during
More informationDiscrete Applied Mathematics
Discrete Applied Mathematics 160 (2012) 505 512 Contents lists available at SciVerse ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam 1-planarity of complete multipartite
More informationNegative Numbers in Combinatorics: Geometrical and Algebraic Perspectives
Negative Numbers in Combinatorics: Geometrical and Algebraic Perspectives James Propp (UMass Lowell) June 29, 2012 Slides for this talk are on-line at http://jamespropp.org/msri-up12.pdf 1 / 99 I. Equal
More informationNumber Theory and Graph Theory
1 Number Theory and Graph Theory Chapter 6 Basic concepts and definitions of graph theory By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: satya8118@gmail.com
More informationCOMP 251 Winter 2017 Online quizzes with answers
COMP 251 Winter 2017 Online quizzes with answers Open Addressing (2) Which of the following assertions are true about open address tables? A. You cannot store more records than the total number of slots
More informationFlexible Coloring. Xiaozhou Li a, Atri Rudra b, Ram Swaminathan a. Abstract
Flexible Coloring Xiaozhou Li a, Atri Rudra b, Ram Swaminathan a a firstname.lastname@hp.com, HP Labs, 1501 Page Mill Road, Palo Alto, CA 94304 b atri@buffalo.edu, Computer Sc. & Engg. dept., SUNY Buffalo,
More information[8] that this cannot happen on the projective plane (cf. also [2]) and the results of Robertson, Seymour, and Thomas [5] on linkless embeddings of gra
Apex graphs with embeddings of face-width three Bojan Mohar Department of Mathematics University of Ljubljana Jadranska 19, 61111 Ljubljana Slovenia bojan.mohar@uni-lj.si Abstract Aa apex graph is a graph
More informationNote. On the Thickness and Arboricity of a Graph
JOURNAL OF COMBINATORIAL THEORY, Series B 52, 147-151 ([991) Note On the Thickness and Arboricity of a Graph ALICE M. DEAN Department of Mathematics and Computer Science, Skidmore College, Saratoga Springs,
More informationDiscrete Mathematics
Discrete Mathematics 310 (2010) 2769 2775 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Optimal acyclic edge colouring of grid like graphs
More informationCPS 102: Discrete Mathematics. Quiz 3 Date: Wednesday November 30, Instructor: Bruce Maggs NAME: Prob # Score. Total 60
CPS 102: Discrete Mathematics Instructor: Bruce Maggs Quiz 3 Date: Wednesday November 30, 2011 NAME: Prob # Score Max Score 1 10 2 10 3 10 4 10 5 10 6 10 Total 60 1 Problem 1 [10 points] Find a minimum-cost
More information1 Matchings in Graphs
Matchings in Graphs J J 2 J 3 J 4 J 5 J J J 6 8 7 C C 2 C 3 C 4 C 5 C C 7 C 8 6 J J 2 J 3 J 4 J 5 J J J 6 8 7 C C 2 C 3 C 4 C 5 C C 7 C 8 6 Definition Two edges are called independent if they are not adjacent
More informationTHE INDEPENDENCE NUMBER PROJECT:
THE INDEPENDENCE NUMBER PROJECT: α-properties AND α-reductions C. E. LARSON DEPARTMENT OF MATHEMATICS AND APPLIED MATHEMATICS VIRGINIA COMMONWEALTH UNIVERSITY 1. Introduction A graph property P is an α-property
More informationA Connection between Network Coding and. Convolutional Codes
A Connection between Network Coding and 1 Convolutional Codes Christina Fragouli, Emina Soljanin christina.fragouli@epfl.ch, emina@lucent.com Abstract The min-cut, max-flow theorem states that a source
More informationPACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS
PACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS PAUL BALISTER Abstract It has been shown [Balister, 2001] that if n is odd and m 1,, m t are integers with m i 3 and t i=1 m i = E(K n) then K n can be decomposed
More informationGenerating edge covers of path graphs
Generating edge covers of path graphs J. Raymundo Marcial-Romero, J. A. Hernández, Vianney Muñoz-Jiménez and Héctor A. Montes-Venegas Facultad de Ingeniería, Universidad Autónoma del Estado de México,
More informationFundamental Properties of Graphs
Chapter three In many real-life situations we need to know how robust a graph that represents a certain network is, how edges or vertices can be removed without completely destroying the overall connectivity,
More informationOrthogonal art galleries with holes: a coloring proof of Aggarwal s Theorem
Orthogonal art galleries with holes: a coloring proof of Aggarwal s Theorem Pawe l Żyliński Institute of Mathematics University of Gdańsk, 8095 Gdańsk, Poland pz@math.univ.gda.pl Submitted: Sep 9, 005;
More informationEquivalence of the filament and overlap graphs of subtrees of limited trees
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 19:1, 2017, #20 Equivalence of the filament and overlap graphs of subtrees of limited trees arxiv:1508.01441v4 [cs.dm] 14 Jun 2017 Jessica
More informationTHE INSULATION SEQUENCE OF A GRAPH
THE INSULATION SEQUENCE OF A GRAPH ELENA GRIGORESCU Abstract. In a graph G, a k-insulated set S is a subset of the vertices of G such that every vertex in S is adjacent to at most k vertices in S, and
More informationMinimal dominating sets in graph classes: combinatorial bounds and enumeration
Minimal dominating sets in graph classes: combinatorial bounds and enumeration Jean-François Couturier 1, Pinar Heggernes 2, Pim van t Hof 2, and Dieter Kratsch 1 1 LITA, Université Paul Verlaine - Metz,
More informationFundamental mathematical techniques reviewed: Mathematical induction Recursion. Typically taught in courses such as Calculus and Discrete Mathematics.
Fundamental mathematical techniques reviewed: Mathematical induction Recursion Typically taught in courses such as Calculus and Discrete Mathematics. Techniques introduced: Divide-and-Conquer Algorithms
More informationA note on the number of edges guaranteeing a C 4 in Eulerian bipartite digraphs
A note on the number of edges guaranteeing a C 4 in Eulerian bipartite digraphs Jian Shen Department of Mathematics Southwest Texas State University San Marcos, TX 78666 email: js48@swt.edu Raphael Yuster
More informationImproved algorithms for constructing fault-tolerant spanners
Improved algorithms for constructing fault-tolerant spanners Christos Levcopoulos Giri Narasimhan Michiel Smid December 8, 2000 Abstract Let S be a set of n points in a metric space, and k a positive integer.
More informationChapter 9 Graph Algorithms
Chapter 9 Graph Algorithms 2 Introduction graph theory useful in practice represent many real-life problems can be if not careful with data structures 3 Definitions an undirected graph G = (V, E) is a
More informationGraph Representations and Traversal
COMPSCI 330: Design and Analysis of Algorithms 02/08/2017-02/20/2017 Graph Representations and Traversal Lecturer: Debmalya Panigrahi Scribe: Tianqi Song, Fred Zhang, Tianyu Wang 1 Overview This lecture
More informationColoring edges and vertices of graphs without short or long cycles
Coloring edges and vertices of graphs without short or long cycles Marcin Kamiński and Vadim Lozin Abstract Vertex and edge colorability are two graph problems that are NPhard in general. We show that
More informationSome Upper Bounds for Signed Star Domination Number of Graphs. S. Akbari, A. Norouzi-Fard, A. Rezaei, R. Rotabi, S. Sabour.
Some Upper Bounds for Signed Star Domination Number of Graphs S. Akbari, A. Norouzi-Fard, A. Rezaei, R. Rotabi, S. Sabour Abstract Let G be a graph with the vertex set V (G) and edge set E(G). A function
More informationCIS 121 Data Structures and Algorithms Midterm 3 Review Solution Sketches Fall 2018
CIS 121 Data Structures and Algorithms Midterm 3 Review Solution Sketches Fall 2018 Q1: Prove or disprove: You are given a connected undirected graph G = (V, E) with a weight function w defined over its
More informationThe Geometry of Carpentry and Joinery
The Geometry of Carpentry and Joinery Pat Morin and Jason Morrison School of Computer Science, Carleton University, 115 Colonel By Drive Ottawa, Ontario, CANADA K1S 5B6 Abstract In this paper we propose
More informationSquare Difference Prime Labeling for Some Snake Graphs
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 3 (017), pp. 1083-1089 Research India Publications http://www.ripublication.com Square Difference Prime Labeling for Some
More informationVertex Magic Total Labelings of Complete Graphs
AKCE J. Graphs. Combin., 6, No. 1 (2009), pp. 143-154 Vertex Magic Total Labelings of Complete Graphs H. K. Krishnappa, Kishore Kothapalli and V. Ch. Venkaiah Center for Security, Theory, and Algorithmic
More informationRecognition and Orientation Algorithms for P 4 -comparability Graphs
Recognition and Orientation Algorithms for P 4 -comparability Graphs Stavros D. Nikolopoulos and Leonidas Palios Department of Computer Science, University of Ioannina GR-45110 Ioannina, Greece {stavros,palios}@cs.uoi.gr
More informationThe Fibonacci hypercube
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 40 (2008), Pages 187 196 The Fibonacci hypercube Fred J. Rispoli Department of Mathematics and Computer Science Dowling College, Oakdale, NY 11769 U.S.A. Steven
More informationOn the Rigidity of Ramanujan Graphs
On the Rigidity of Ramanujan Graphs Brigitte Servatius Mathematical Sciences Worcester Polytechnic Institute Worcester MA 01609 1 Introduction A graph G is generically [4] rigid in dimension one if and
More informationLayer-Based Scheduling Algorithms for Multiprocessor-Tasks with Precedence Constraints
Layer-Based Scheduling Algorithms for Multiprocessor-Tasks with Precedence Constraints Jörg Dümmler, Raphael Kunis, and Gudula Rünger Chemnitz University of Technology, Department of Computer Science,
More informationAn upper bound for the chromatic number of line graphs
EuroComb 005 DMTCS proc AE, 005, 151 156 An upper bound for the chromatic number of line graphs A D King, B A Reed and A Vetta School of Computer Science, McGill University, 3480 University Ave, Montréal,
More informationA Transformational Characterization of Markov Equivalence for Directed Maximal Ancestral Graphs
A Transformational Characterization of Markov Equivalence for Directed Maximal Ancestral Graphs Jiji Zhang Philosophy Department Carnegie Mellon University Pittsburgh, PA 15213 jiji@andrew.cmu.edu Abstract
More informationSome Approximation Algorithms for Constructing Combinatorial Structures Fixed in Networks
Some Approximation Algorithms for Constructing Combinatorial Structures Fixed in Networks Jianping Li Email: jianping@ynu.edu.cn Department of Mathematics Yunnan University, P.R. China 11 / 31 8 ¹ 1 3
More information11/22/2016. Chapter 9 Graph Algorithms. Introduction. Definitions. Definitions. Definitions. Definitions
Introduction Chapter 9 Graph Algorithms graph theory useful in practice represent many real-life problems can be slow if not careful with data structures 2 Definitions an undirected graph G = (V, E) is
More informationOn the Number of Linear Extensions of Graphs
On the Number of Linear Extensions of Graphs Annie Hu under the direction of Mr. Benjamin Iriarte Massachusetts Institute of Technology Research Science Institute 15 January 2014 Abstract Given a bipartite
More informationChapter 9 Graph Algorithms
Chapter 9 Graph Algorithms 2 Introduction graph theory useful in practice represent many real-life problems can be slow if not careful with data structures 3 Definitions an undirected graph G = (V, E)
More informationThe NP-Completeness of Some Edge-Partition Problems
The NP-Completeness of Some Edge-Partition Problems Ian Holyer y SIAM J. COMPUT, Vol. 10, No. 4, November 1981 (pp. 713-717) c1981 Society for Industrial and Applied Mathematics 0097-5397/81/1004-0006
More informationFinding a winning strategy in variations of Kayles
Finding a winning strategy in variations of Kayles Simon Prins ICA-3582809 Utrecht University, The Netherlands July 15, 2015 Abstract Kayles is a two player game played on a graph. The game can be dened
More informationTriangle Graphs and Simple Trapezoid Graphs
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 18, 467-473 (2002) Short Paper Triangle Graphs and Simple Trapezoid Graphs Department of Computer Science and Information Management Providence University
More informationBottleneck Steiner Tree with Bounded Number of Steiner Vertices
Bottleneck Steiner Tree with Bounded Number of Steiner Vertices A. Karim Abu-Affash Paz Carmi Matthew J. Katz June 18, 2011 Abstract Given a complete graph G = (V, E), where each vertex is labeled either
More informationStar coloring planar graphs from small lists
Star coloring planar graphs from small lists André Kündgen Craig Timmons June 4, 2008 Abstract A star coloring of a graph is a proper vertex-coloring such that no path on four vertices is 2-colored. We
More informationSolving Linear Recurrence Relations (8.2)
EECS 203 Spring 2016 Lecture 18 Page 1 of 10 Review: Recurrence relations (Chapter 8) Last time we started in on recurrence relations. In computer science, one of the primary reasons we look at solving
More informationEDGE MAXIMAL GRAPHS CONTAINING NO SPECIFIC WHEELS. Jordan Journal of Mathematics and Statistics (JJMS) 8(2), 2015, pp I.
EDGE MAXIMAL GRAPHS CONTAINING NO SPECIFIC WHEELS M.S.A. BATAINEH (1), M.M.M. JARADAT (2) AND A.M.M. JARADAT (3) A. Let k 4 be a positive integer. Let G(n; W k ) denote the class of graphs on n vertices
More informationParameterized graph separation problems
Parameterized graph separation problems Dániel Marx Department of Computer Science and Information Theory, Budapest University of Technology and Economics Budapest, H-1521, Hungary, dmarx@cs.bme.hu Abstract.
More information