Journal Article10.1137/0214065
A linear recognition algorithm for cographs
710
TL;DR: This paper presents a linear time algorithm for recognizing cographs and constructing their cotree representation, which is possible to design very fast polynomial time algorithms for problems which are intractable for graphs in general.
read more
Abstract: Cographs are the graphs formed from a single vertex under the closure of the operations of union and complement. Another characterization of cographs is that they are the undirected graphs with no induced paths on four vertices. Cographs arise naturally in such application areas as examination scheduling and automatic clustering of index terms. Furthermore, it is known that cographs have a unique tree representation called a cotree. Using the cotree it is possible to design very fast polynomial time algorithms for problems which are intractable for graphs in general. Such problems include chromatic number, clique determination, clustering, minimum weight domination, isomorphism, minimum fill-in and Hamiltonicity. In this paper we present a linear time algorithm for recognizing cographs and constructing their cotree representation.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Structural diversity and chemical trends in hybrid inorganic–organic framework materials
TL;DR: The diversity of this complex class of materials is examined, a simple but systematic classification is proposed, and the growing evidence that many hybrid frameworks tend to form under thermodynamic rather than kinetic control when the synthesis is carried out under hydrothermal conditions is discussed.
1.5K
Upper bounds to the clique width of graphs
Bruno Courcelle,Stephan Olariu +1 more
TL;DR: Clique width is bound in terms of its tree width on the one hand, and of the clique width of its edge complement on the other, to reduce the complexity measure of graphs associated with hierarchical decompositions.
832
Approximating clique-width and branch-width
Sang-il Oum,Paul Seymour +1 more
TL;DR: A polynomial-time algorithm to approximate the branch-width of certain symmetric sub-modular functions, and gives two applications to graph "clique-width" and the area of matroid branch- width.
700
Modular decomposition and transitive orientation
TL;DR: This work gives O(n+m) algorithms for modular decomposition and transitive orientation, where n and m are the number of vertices and edges of the graph and linear time bounds for recognizing permutation graphs, maximum clique and minimum vertex coloring on comparability graphs, and other combinatorial problems on comparable graphs and their complements.
506
•Book
Kernelization: Theory of Parameterized Preprocessing
Fedor V. Fomin,Daniel Lokshtanov,Saket Saurabh,Meirav Zehavi +3 more
- 28 Feb 2019
TL;DR: Kernelization: Theory of Parameterized Preprocessing, by Fomin et al., is unique in that it is a text focusing solely on the titular topic of kernelization, and is able to more effectively showcase and teach the tools used in the field than a more traditional text on fixed parameter complexity.
253
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
The complexity of theorem-proving procedures
Stephen A. Cook
- 03 May 1971
TL;DR: It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology.
7.4K
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
TL;DR: The consecutive ones test for the consecutive ones property in matrices and for graph planarity is extended to a test for interval graphs using a recently discovered fast recognition algorithm for chordal graphs.
1.7K
Algorithmic Aspects of Vertex Elimination on Graphs
TL;DR: A graph-theoretic elimination process which is related to performing Gaussian elimination on sparse symmetric positive definite systems of linear equations is considered, and it is conjecture that the problem of finding a minimum ordering is NP-complete.
1.4K
Efficient Planarity Testing
TL;DR: An efficient algorithm to determine whether an arbitrary graph G can be embedded in the plane is described, which used depth-first search and has time and space bounds.
Related Papers (5)
Andreas Brandstädt,Van Bang Le,Jeremy P. Spinrad +2 more
- 01 Jan 1987
Martin Charles Golumbic
- 01 Jan 1980