Download or read book A Generalization of Chordal Graphs written by Jose M. Bonnin Cadogan and published by . This book was released on 2011 with total page 20 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Treelike and Chordal Graphs written by Frank Kammer and published by . This book was released on 2010 with total page 206 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Generalized Strongly Chordal Graphs written by Elias Dahlhaus and published by . This book was released on 1993 with total page 15 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "This paper discusses a generalization of strongly chordal graphs. We consider characteristic elimination orderings for these graphs and prove their perfectness."
Download or read book Strongly Orderable Graphs written by and published by . This book was released on 1998 with total page 18 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Chordal Graphs and Semidefinite Optimization written by Lieven Vandenberghe and published by Foundations and Trends (R) in Optimization. This book was released on 2015-04-30 with total page 216 pages. Available in PDF, EPUB and Kindle. Book excerpt: Covers the theory and applications of chordal graphs, with an emphasis on algorithms developed in the literature on sparse Cholesky factorization. It shows how these techniques can be applied in algorithms for sparse semidefinite optimization, and points out the connections with related topics outside semidefinite optimization.
Download or read book Graph Classes written by Andreas Brandstadt and published by SIAM. This book was released on 1999-01-01 with total page 315 pages. Available in PDF, EPUB and Kindle. Book excerpt: This well-organized reference is a definitive encyclopedia for the literature on graph classes. It contains a survey of more than 200 classes of graphs, organized by types of properties used to define and characterize the classes, citing key theorems and literature references for each. The authors state results without proof, providing readers with easy access to far more key theorems than are commonly found in other mathematical texts. Interconnections between graph classes are also provided to make the book useful to a variety of readers.
Download or read book Treelike and Chordal Graphs Algorithms and Generalizations written by Frank Kammer and published by . This book was released on 2012 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Complexity of Generalized Colourings of Chordal Graphs written by Juraj Stacho and published by . This book was released on 2008 with total page 336 pages. Available in PDF, EPUB and Kindle. Book excerpt: The generalized graph colouring problem (GCOL) for a fixed integer k, and fixed classes of graphs P1...,P_k (usually describing some common graph properties), is to decide, for a given graph G, whether the vertex set of G can be partitioned into sets V1,..., V_k such that, for each I, the induced subgraph of G on V_i belongs to P_i. It can be seen that GCOL generalizes many natural colouring and partitioning problems on graphs. In this thesis, we focus on generalized colouring problems in chordal graphs. The structure of chordal graphs is known to allow solving many difficult combinatorial problems, such as the graph colouring, maximum clique and others, in polynomial, and in many cases in linear time. Our study of generalized colouring problems focuses on those problems in which the sets P_i are characterized by a single forbidden induced subgraph. We show, that for k=2, all such problems where the forbidden graphs have at most three vertices are polynomial time solvable in chordal graphs, whereas, it is known that almost all of them are NP-complete in general. On the other hand, we show infinite families of such problems which are NP-complete in chordal graphs. By combining a polynomial algorithm and an NP-completeness proof, we answer a question of Broersma, Fomin, Nešetril and Woeginger about the complexity of the so-called subcolouring problem on chordal graphs. Additionally, we explain, how some of these results generalize to particular subclasses of chordal graphs, and we show a complete forbidden subgraph characterization for the so-called monopolar partitions of chordal graphs. Finally, in the last part of the thesis, we focus on a different type of colouring problem -- injective colouring. We describe several algorithmic and (in-)approximability results for injective colourings in the class of chordal graphs and its subclasses. In the process, we correct a result of Agnarsson et al. on inapproximability of the chromatic number of the square of a split graph.
Download or read book On Listing Sampling and Counting the Chordal Graphs with Edge Constraints written by Shuji Kijima and published by . This book was released on 2007 with total page 15 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "We discuss the problems to list, sample, and count the chordal graphs with edge constraints. The edge constraints are given as a pair of graphs one of which contains the other and one of which is chordal, and the objects we look at are the chordal graphs contained in one and containing the other. This setting is a natural generalization of chordal completions and deletions. For the listing problem, we give an efficient algorithm running in amortized polynomial time per output with polynomial space. For the sampling problem, we give an instance for which a natural Markov chain suffers from an exponential mixing time. For the counting problem, we show some #P-completeness results. These results provide a unified viewpoint from algorithms theory to problems arising from various areas such as statistics, data mining, and numerical computation."
Download or read book Tolerance Graphs written by Martin Charles Golumbic and published by Cambridge University Press. This book was released on 2004-02-12 with total page 282 pages. Available in PDF, EPUB and Kindle. Book excerpt: A rigorous treatment of tolerance graphs for researchers and graduate students which collects important results and discusses applications.
Download or read book Generalized Domination in Chordal Graphs written by Jan Kratochvíl and published by . This book was released on 1995 with total page 9 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Approximation Randomization and Combinatorial Optimization Algorithms and Techniques written by Maria Serna and published by Springer Science & Business Media. This book was released on 2010-08-19 with total page 794 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the joint refereed proceedings of the 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2010, and the 14th International Workshop on Randomization and Computation, RANDOM 2010, held in Barcelona, Spain, in September 2010. The 28 revised full papers of the APPROX 2010 workshop and the 29 revised full papers of the RANDOM 2010 workshop included in this volume, were carefully reviewed and selected from 66 and 61 submissions, respectively. APPROX focuses on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM is concerned with applications of randomness to computational and combinatorial problems.
Download or read book Applications of Combinatorics and Graph Theory to the Biological and Social Sciences written by Fred Roberts and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 345 pages. Available in PDF, EPUB and Kindle. Book excerpt: This IMA Volume in Mathematics and its Applications Applications of Combinatorics and Graph Theory to the Biological and Social Sciences is based on the proceedings of a workshop which was an integral part of the 1987-88 IMA program on APPLIED COMBINATORICS. We are grateful to the Scientific Committee: Victor Klee (Chairman), Daniel Kleitman, Dijen Ray-Chaudhuri and Dennis Stanton for planning and implementing an exciting and stimulating year long program. We especially thank the Workshop Organizers, Joel Cohen and Fred Roberts, for organizing a workshop which brought together many of the major figures in a variety of research fields connected with the application of combinatorial ideas to the social and biological sciences. A vner Friedman Willard Miller APPLICATIONS OF COMBINATORICS AND GRAPH THEORY TO THE BIOLOGICAL AND SOCIAL SCIENCES: SEVEN FUNDAMENTAL IDEAS FRED S. RoBERTS* Abstract. To set the stage for the other papers in this volume, seven fundamental concepts which arise in the applications of combinatorics and graph theory in the biological and social sciences are described. These ideas are: RNA chains as "words" in a 4 letter alphabet; interval graphs; competition graphs or niche overlap graphs; qualitative stability; balanced signed graphs; social welfare functions; and semiorders. For each idea, some basic results are presented, some recent results are given, and some open problems are mentioned.
Download or read book Algorithms and Data Structures written by Zachary Friggstad and published by Springer. This book was released on 2019-07-31 with total page 610 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 16th International Symposium on Algorithms and Data Structures, WADS, 2019, held in Edmonton, AB, Canada, in August 2019. The 42 full papers presented together with 3 invited lectures, we carefully reviewed and selected from a total of 88 submissions. They present original research on the theory and application of algorithms and data structures in many areas, including combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.
Download or read book Graph Theoretic Concepts in Computer Science written by Andreas Brandstädt and published by Springer. This book was released on 2013-11-12 with total page 446 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the thoroughly refereed proceedings of the 39th International Workshop on Graph Theoretic Concepts in Computer Science, WG 2013, held in Lübeck, Germany, in June 2013. The 34 revised full papers presented were carefully reviewed and selected from 61 submissions. The book also includes two abstracts. The papers cover a wide range of topics in graph theory related to computer science, such as structural graph theory with algorithmic or complexity applications; design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms; computational complexity of graph and network problems; computational geometry; graph grammars, graph rewriting systems and graph modeling; graph drawing and layouts; random graphs and models of the web and scale-free networks; and support of these concepts by suitable implementations and applications.
Download or read book Graph Theoretic Concepts in Computer Science written by Dieter Kratsch and published by Springer. This book was released on 2005-12-06 with total page 481 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the thoroughly refereed post-proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2005, held in Metz, France in June 2005. The 38 revised full papers presented together with 2 invited papers were carefully selected from 125 submissions. The papers provide a wealth of new results for various classes of graphs, graph computations, graph algorithms, and graph-theoretical applications in various fields. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in Computer Science, or by extracting new problems from applications. The goal is to present recent research results and to identify and explore directions of future research.
Download or read book Fundamentals of Computation Theory written by Horst Reichel and published by Springer Science & Business Media. This book was released on 1995-08-16 with total page 454 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book presents the proceedings of the 10th International Conference on Fundamentals of Computation Theory, FCT '95, held in Dresden, Germany in August 1995. The volume contains five invited lectures and 32 revised papers carefully selected for presentation at FCT '95. A broad spectrum of theoretical computer science is covered; among topics addressed are algorithms and data structures, automata and formal languages, categories and types, computability and complexity, computational logics, computational geometry, systems specification, learning theory, parallelism and concurrency, rewriting and high-level replacement systems, and semantics.
