Download or read book The parallel and sequential complexity of matching on chordal and strongly chordal graphs written by Elias Dahlhaus and published by . This book was released on 1995 with total page 20 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book On the sequential and parallel complexity of matching in chordal and strongly chordal graphs written by Elias Dahlhaus and published by . This book was released on 1994 with total page 14 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book On the Computational Complexity of Matching on Chordal and Strongly Chordal Graphs written by International Computer Science Institute and published by . This book was released on 1994 with total page 26 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "In this paper we study the computational complexity (both sequential and parallel) of the maximum matching problem for chordal and strongly chordal graphs. We show that there is a linear time greedy algorithm for a maximum matching in a strongly chordal graph provided a strongly perfect elimination ordering is known. This algorithm can be also turned into a parallel algorithm. The technique used can be also extended for the multidimensional matching for chordal and strongly chordal graphs yielding the first polynomial time algorithms for these classes of graphs (the multidimensional matching is NP-complete in general)."
Download or read book The parallel and sequental complexity of matching on chordal and strongly chordal graphs written by Elias Dahlhaus and published by . This book was released on 1995 with total page 20 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book On the Parallel Complexity of Matching for Chordal Graphs and Path Graphs written by Elias Dahlhaus and published by . This book was released on 1987 with total page 26 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book On Parallel Complexity of Matching for Chordal and Path Graphs written by Mathematical Sciences Research Institute (Berkeley, Calif.). and published by . This book was released on 1987 with total page 13 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Algorithms and Complexity written by Bozzano G Luisa and published by Elsevier. This book was released on 1990-09-12 with total page 1014 pages. Available in PDF, EPUB and Kindle. Book excerpt: This first part presents chapters on models of computation, complexity theory, data structures, and efficient computation in many recognized sub-disciplines of Theoretical Computer Science.
Download or read book Combinatorial Optimization and Applications written by T-H. Hubert Chan and published by Springer. This book was released on 2016-11-30 with total page 800 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 10th International Conference on Combinatorial Optimization and Applications, COCOA 2016, held in Hong Kong, China, in December 2016. The 60 full papers included in the book were carefully reviewed and selected from 122 submissions. The papers are organized in topical sections such as graph theory, geometric optimization, complexity and data structure, combinatorial optimization, and miscellaneous.
Download or read book The Maximum Induced Matching Problem for Some Subclasses of Weakly Chordal Graphs written by Chandra Mohan Krishnamurthy and published by . This book was released on 2009 with total page 84 pages. Available in PDF, EPUB and Kindle. Book excerpt: An induced matching in a graph is a set of edges such that no two edges in the set are joined by any third edge of the graph. An induced matching is maximum (MIM) if the number of edges in it is the largest among all possible induced matchings. It is known that finding the size of MIM in a graph is NP-hard even if the graph is bipartite. It is also known that the size of MIM in a chordal graph or in a weakly chordal graph can be computed in polynomial time. Specifically, the size of MIM can be computed in linear time for a chordal graph and in O(m3) time for a weakly chordal graph. This work demonstrates some algorithms for the maximum induced matching problem with complexity better than O(m3) for some subclasses of weakly chordal graphs. In particular, we show that the maximum induced matching problem can be solved on hhd-free graphs in O(m2) time. Further, for two subclasses of hhd-free graphs, we show that the problem can be solved in better time than O(m2). The classes of graphs that we consider are either more general than chordal graphs or are a restriction of chordal bipartite graphs.
Download or read book Computational Graph Theory written by Gottfried Tinhofer and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 282 pages. Available in PDF, EPUB and Kindle. Book excerpt: One ofthe most important aspects in research fields where mathematics is "applied is the construction of a formal model of a real system. As for structural relations, graphs have turned out to provide the most appropriate tool for setting up the mathematical model. This is certainly one of the reasons for the rapid expansion in graph theory during the last decades. Furthermore, in recent years it also became clear that the two disciplines of graph theory and computer science have very much in common, and that each one has been capable of assisting significantly in the development of the other. On one hand, graph theorists have found that many of their problems can be solved by the use of com puting techniques, and on the other hand, computer scientists have realized that many of their concepts, with which they have to deal, may be conveniently expressed in the lan guage of graph theory, and that standard results in graph theory are often very relevant to the solution of problems concerning them. As a consequence, a tremendous number of publications has appeared, dealing with graphtheoretical problems from a computational point of view or treating computational problems using graph theoretical concepts.
Download or read book Quo Vadis Graph Theory written by J. Gimbel and published by Elsevier. This book was released on 1993-03-17 with total page 407 pages. Available in PDF, EPUB and Kindle. Book excerpt: Graph Theory (as a recognized discipline) is a relative newcomer to Mathematics. The first formal paper is found in the work of Leonhard Euler in 1736. In recent years the subject has grown so rapidly that in today's literature, graph theory papers abound with new mathematical developments and significant applications. As with any academic field, it is good to step back occasionally and ask Where is all this activity taking us?, What are the outstanding fundamental problems?, What are the next important steps to take?. In short, Quo Vadis, Graph Theory?. The contributors to this volume have together provided a comprehensive reference source for future directions and open questions in the field.
Download or read book Topics in Algorithmic Graph Theory written by Lowell W. Beineke and published by Cambridge University Press. This book was released on 2021-06-03 with total page 400 pages. Available in PDF, EPUB and Kindle. Book excerpt: Algorithmic graph theory has been expanding at an extremely rapid rate since the middle of the twentieth century, in parallel with the growth of computer science and the accompanying utilization of computers, where efficient algorithms have been a prime goal. This book presents material on developments on graph algorithms and related concepts that will be of value to both mathematicians and computer scientists, at a level suitable for graduate students, researchers and instructors. The fifteen expository chapters, written by acknowledged international experts on their subjects, focus on the application of algorithms to solve particular problems. All chapters were carefully edited to enhance readability and standardize the chapter structure as well as the terminology and notation. The editors provide basic background material in graph theory, and a chapter written by the book's Academic Consultant, Martin Charles Golumbic (University of Haifa, Israel), provides background material on algorithms as connected with graph theory.
Download or read book The matching problem for strongly chordal graphs is in NC written by Elias Dahlhaus and published by . This book was released on 1986 with total page 14 pages. Available in PDF, EPUB and Kindle. Book excerpt:
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 Automata Languages and Programming written by Javier Esparza and published by Springer. This book was released on 2014-06-11 with total page 1122 pages. Available in PDF, EPUB and Kindle. Book excerpt: This two-volume set of LNCS 8572 and LNCS 8573 constitutes the refereed proceedings of the 41st International Colloquium on Automata, Languages and Programming, ICALP 2014, held in Copenhagen, Denmark, in July 2014. The total of 136 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 484 submissions. The papers are organized in three tracks focussing on Algorithms, Complexity, and Games, Logic, Semantics, Automata, and Theory of Programming, Foundations of Networked Computation.
Download or read book Integer Programming and Related Areas written by Universität Bonn. Institut für Ökonometrie und Operations Research and published by Springer. This book was released on 1990-07-10 with total page 536 pages. Available in PDF, EPUB and Kindle. Book excerpt: This fifth volume of a comprehensive bibliography lists all available publications on integer programming and combinatorial optimization from autumn 1984 to the end of 1987. The volume compiles and classifies 5867 new publications by 4680 authors under 50 different subject headings. The listing covers theory and methods of general integer programming and applications of integer programming. This classified bibliography will be an invaluable reference source for mathematicians working in optimization, researchers working on integer programming techniques, and industrial operations research departments. The four earlier volumes were published as "Lecture Notes in Economics and Mathematical Systems" Vols. 128, 160, 197 and 243.
Download or read book Mathematical Reviews written by and published by . This book was released on 1999 with total page 1244 pages. Available in PDF, EPUB and Kindle. Book excerpt:
