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 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 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 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 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 Graph Theoretic Concepts in Computer Science written by Rolf H. Möhring and published by Springer Science & Business Media. This book was released on 1997-10-29 with total page 392 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the carefully refereed post-proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG '96, held in Cadenabbia, Italy, in June 1996. The 30 revised full papers presented in the volume were selected from a total of 65 submissions. This collection documents the state of the art in the area. Among the topics addressed are graph algorithms, graph rewriting, hypergraphs, graph drawing, networking, approximation and optimization, trees, graph computation, and others.
Download or read book Integer Programming and Related Areas written by Rabe v. Randow and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 522 pages. Available in PDF, EPUB and Kindle. Book excerpt: The fields of integer programming and combinatorial optimization continue to be areas of great vitality, with an ever increasing number of publications and journals appearing. A classified bibliography thus continues to be necessary and useful today, even more so than it did when the project, of which this is the fifth volume, was started in 1970 in the Institut fur Okonometrie und Operations Research of the University of Bonn. The pioneering first volume was compiled by Claus Kastning during the years 1970 - 1975 and appeared in 1976 as Volume 128 of the series Lecture Notes in Economics and Mathematical Systems published by the Springer Verlag. Work on the project was continued by Dirk Hausmann, Reinhardt Euler, and Rabe von Randow, and resulted in the publication of the second, third, and fourth volumes in 1978, 1982, and 1985 (Volumes 160, 197, and 243 of the above series). The present book constitutes the fifth volume of the bibliography and covers the period from autumn 1984 to the end of 1987. It contains 5864 new publications by 4480 authors and was compiled by Rabe von Randow. Its form is practically identical to that of the first four volumes, some additions having been made to the subject list.
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 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 Handbook of Graph Theory Combinatorial Optimization and Algorithms written by Krishnaiyan "KT" Thulasiraman and published by CRC Press. This book was released on 2016-01-05 with total page 1217 pages. Available in PDF, EPUB and Kindle. Book excerpt: The fusion between graph theory and combinatorial optimization has led to theoretically profound and practically useful algorithms, yet there is no book that currently covers both areas together. Handbook of Graph Theory, Combinatorial Optimization, and Algorithms is the first to present a unified, comprehensive treatment of both graph theory and c
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 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 Graph theoretic Concepts in Computer Science written by and published by . This book was released on 1997 with total page 406 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Computing and Combinatorics written by Chi-Yeh Chen and published by Springer Nature. This book was released on 2021-10-21 with total page 699 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the proceedings of the 27th International Conference on Computing and Combinatorics, COCOON 2021, held in Tainan, Taiwan, in October 2021. Due to the COVID-19 pandemic, COCOON 2021 was organized as a hybrid conference. The 56 papers presented in this volume were carefully reviewed and selected from 131 submissions. The papers are divided into the following topical sub-headings: algorithms, approximation algorithms, automata, computational geometry, fault tolerant computing and fault diagnosis, graph algorithms, graph theory and applications, network and algorithms, online algorithm and stream algorithms, parameterized complexity and algorithms, and recreational games.
Download or read book Mathematical Foundations of Computer Science 2012 written by Branislav Rovan and published by Springer. This book was released on 2012-08-01 with total page 852 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume constitutes the refereed proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science, MFCS 2012, held in Bratislava, Slovakia, in August 2012. The 63 revised full papers presented together with 8 invited talks were carefully reviewed and selected from 162 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.
Download or read book Algorithms and Computation written by Kun-Mao Chao and published by Springer Science & Business Media. This book was released on 2012-12-15 with total page 716 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 23rd International Symposium on Algorithms and Computation, ISAAC 2012, held in Taipei, Taiwan, in December 2012. The 68 revised full papers presented together with three invited talks were carefully reviewed and selected from 174 submissions for inclusion in the book. This volume contains topics such as graph algorithms; online and streaming algorithms; combinatorial optimization; computational complexity; computational geometry; string algorithms; approximation algorithms; graph drawing; data structures; randomized algorithms; and algorithmic game theory.
Download or read book Combinatorial Algorithms written by Leszek Gąsieniec and published by Springer Nature. This book was released on 2020-05-28 with total page 438 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the proceedings of the 31st International Workshop on Combinatorial Algorithms which was planned to take place in Bordeaux, France, during June 8–10, 2020. Due to the COVID-19 pandemic the conference changed to a virtual format. The 30 full papers included in this book were carefully reviewed and selected from 62 submissions. They focus on algorithms design for the myriad of combinatorial problems that underlie computer applications in science, engineering and business.
