Computing a maximum cardinality matching in a bipartite graph in time On1.5m/logn
Information Processing Letters
SIAM Journal on Discrete Mathematics
Characterizations and algorithmic applications of chordal graph embeddings
Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Independent Sets in Asteroidal Triple-Free Graphs
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Diameter Determination on Restricted Graph Faminlies
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Approximating the Bandwidth for Asteroidal Triple-Free Graphs
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Boolean matrix multiplication and transitive closure
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Recognizing Graphs without Asteroidal Triples
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
The dichotomy of list homomorphisms for digraphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
We present an O(n2.376) algorithm for recognizing claw-free AT-free graphs and a linear-time algorithm for computing the set of all central vertices of a claw-free AT-free graph. In addition, we give efficient algorithms that solve the problems INDEPENDENT SET, DOMINATING SET, and COLORING. We argue that all running times achieved are optimal unless better algorithms for a number of famous graph problems such as triangle recognition and bipartite matching have been found. Our algorithms exploit the structure of 2LexBFS schemes.