论文信息 - A simple paradigm for graph recognition: application to cographs and distance hereditary graphs - 字舞流文

A simple paradigm for graph recognition: application to cographs and distance hereditary graphs

Michel Habib | Christophe Paul | Guillaume Damiand | M. Habib | C. Paul | G. Damiand

[1] Robert E. Tarjan,et al. Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

[2] Robert E. Tarjan,et al. Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

[3] Lorna Stewart,et al. A Linear Recognition Algorithm for Cographs , 1985, SIAM J. Comput..

[4] Hans-Jürgen Bandelt,et al. Distance-hereditary graphs , 1986, J. Comb. Theory B.

[5] Peter L. Hammer,et al. Completely separable graphs , 1990, Discret. Appl. Math..

[6] Jeremy P. Spinrad,et al. Linear-time modular decomposition and efficient transitive orientation of comparability graphs , 1994, SODA '94.

[7] Elias Dahlhaus,et al. Efficient Parallel Recognition Algorithms of Cographs and Distance Hereditary Graphs , 1995, Discret. Appl. Math..

[8] Jeremy P. Spinrad,et al. Linear-time transitive orientation , 1997, SODA '97.

[9] Stephan Olariu,et al. The ultimate interval graph recognition algorithm? , 1998, SODA '98.

[10] Laurent Viennot,et al. Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing , 2000, Theor. Comput. Sci..