Journal ArticleDOI
Algorithmic graph theory and perfect graphs
Reads0
Chats0
About:
This article is published in Order.The article was published on 1986-06-01. It has received 1324 citations till now. The article focuses on the topics: Trivially perfect graph & Perfect graph theorem.read more
Citations
More filters
Posted Content
Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs
Nathan Lindzey,Ross M. McConnell +1 more
TL;DR: The minimal forbidden submatrices of binary matrices that do not have the consecutive-ones property are characterized and a linear-time algorithm to find one in any binary matrix that does not have a consecutive-one property is given.
Posted Content
Efficient enumeration of maximal split subgraphs and sub-cographs and related classes.
TL;DR: This paper presents efficient algorithms to list all maximal split subgraphs, sub-cographs and some subclasses of cographs of a given input graph and shows that this problem is NP-complete for every "interesting" hereditary property of $\Pi.
Book ChapterDOI
The Local Ratio Technique and Its Application to Scheduling and Resource Allocation Problems
TL;DR: A short survey of the local ratio technique for approximation algorithms, focusing mainly on scheduling and resource allocation problems, is given.
A Linear-Time Algorithm for the Terminal Path Cover Problem in Trees
Ruo-Wei Hong,Chi-Hyi Laio +1 more
TL;DR: In this article, it was shown that the terminal path cover problem on cographs can be solved in linear time. But it is not a special case of path cover with T be empty.
Register Allocation: What does Chaitin's NP-completeness Proof Really Prove?
TL;DR: Chaitin’s proof is revisited to better identity the interactions betweenspilling (load/store insertion), coalescing/splitting (moves between registers), criticaledges (a property of the control-flow graph), and coloring (assignment to registers).
References
More filters
Journal ArticleDOI
Interval graphs and related topics
TL;DR: A more general paradigm for studying various classes of graphs is suggested which can be described as follows: when 9 is allowed to be an arbitrary family of sets, the class obtained as intersection graphs is all undirected graphs.