A simple linear time algorithm for cograph recognition

A simple linear time algorithm for cograph recognition (2005)

Cached

Download Links

[www.lirmm.fr]
[www.ecp6.jussieu.fr]

Other Repositories/Bibliography

DBLP

by Michel Habib , Christophe Paul

Venue:	Discrete Applied Mathematics
Citations:	5 - 2 self

BibTeX

@ARTICLE{Habib05asimple,
    author = {Michel Habib and Christophe Paul},
    title = {A simple linear time algorithm for cograph recognition},
    journal = {Discrete Applied Mathematics},
    year = {2005},
    volume = {145}
}

Bookmark

OpenURL

Abstract

www.elsevier.com/locate/dam

Citations

314	R.: Three partition refinement algorithms - Paige, Tarjan - 1987
140	L.K.: A linear recognition algorithm for cographs - Corneil, Perl, et al. - 1985
76	A new linear algorithm for modular decomposition, LNCS 787 - Cournier, Habib - 1994
69	Transitiv orientierbare Graphen - Gallai - 1967
56	Linear-time modular decomposition and efficient transitive orientation of comparability graphs - McConnell, Spinrad - 1994
46	Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing - Habib, McConnell, et al. - 2000
33	Substitution decomposition on chordal graphs and its applications - Hsu, Ma - 1991
29	On a property of the class of n-colorable graphs - Seinsche - 1974
25	Perfect graphs - Hoàng - 1985
24	Efficient and practical algorithm for sequential modular decomposition algorithm - Dahlhaus, Gustedt, et al.
20	A simple linear time LexBFS cograph recognition algorithm—extended abstract - Bretscher, Corneil, et al. - 2003
19	Three partition re nement algorithms - Paige, Tarjan - 1987
18	A tree representation for P4-sparse graphs - Jamison, Olariu - 1992
15	Robust algorithms for restricted domains - Raghavan, Spinrad
14	Partition Refinement Techniques: An Interesting Algorithmic Tool Kit - Habib, Paul, et al. - 1999
13	Linear-time modular decomposition and ecient transitive orientation of comparability graphs - McConnell, Spinrad - 1994
12	A simple paradigm for graph recognition: application to cographs and distance hereditary graphs, Theoret - Damiand, Habib, et al.
9	A new class of brittle graphs - Jamison, Olariu - 1989
8	Graph decompositions and factorizing permutations - Capelle, Habib, et al.
8	Olariu: A Unique Tree Representation for P 4 -sparse Graphs - Jamison, S - 1992
6	Decomposition de graphes et permutations factorisantes - Capelle - 1997
5	Partition re nement techniques: an interesting algorithmic toolkit - Habib, Paul, et al. - 1999
4	Linear time recognition of P4-indifference graphs, Discrete - Habib, Paul, et al.
3	Lex-bfs and partition re nement, with applications to transitive orientation, interval graph recognition and consecutive ones testing, Theoret - Habib, McConnell, et al.
2	d Montgolfier. Graph decomposition and factorising permutations - Capelle, Habib, et al. - 2002
2	Ecient parallel algorithms of of cographs and distance hereditatary graphs - Dahlhaus - 1995
2	Linear time recognition of p 4 - indierence graphs - Habib, Paul, et al.
1	p4-reducible graphs—a class of uniquely representable graphs - Jamison, Olariu - 1989
1	Perfect graphs - Hong - 1985
1	p 4 -reducible graphs - a class of uniquely representable graphs - Jamison, Olariu - 1989