Asteroidal Triple-Free Graphs (1997)

by Derek G. Corneil , Stephan Olariu , Lorna Stewart
Citations:55 - 10 self

Documents Related by Co-Citation

1134 Algorithmic Graph Theory and Perfect Graphs – M C Golumbic - 1980
133 Representation of a finite graph by a set of intervals on the real line – J C Boland, C G Lekkerkerker - 1962
12 A Linear Time Algorithm to Compute a Dominating Path in an AT-free Graph – Derek G. Corneil, Stephan Olariu, Lorna Stewart - 1998
327 Complexity of finding embeddings in a k-tree – S Arnborg, D G Corneil, A Proskurowski - 1987
183 Computing the minimum fill-in is NPcomplete – M Yannakakis - 1981
294 Algorithmic aspects of vertex elimination on graphs – D J Rose, R E Tarjan, G S Lueker - 1976
245 Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs – R E Tarjan, M Yannakakis - 1984
64 Fixed-parameter tractability of graph modification problems for hereditary properties – L Cai - 1996
366 Graph minors. II. Algorithmic aspects of treewidth – N Robertson, P D Seymour - 1986
10964 Computers and Intractability: A Guide to the Theory of NP-Completeness – M Garey, D Johnson - 1979
114 On Rigid Circuit Graphs – G A Dirac - 1961
40 Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal and Proper Interval Graphs – Haim Kaplan, Ron Shamir, Robert E. Tarjan - 1994
57 Four Strikes against Physical Mapping of DNA – Paul W. Goldberg, Martin C. Golumbic, Haim Kaplan, Ron Shamir - 1993
35 Approximating the Bandwidth for Asteroidal Triple-Free Graphs – Ton Kloks, Dieter Kratsch, Haiko Müller
84 A characterization of comparability graphs and of interval graphs – P C Gilmore, A J Hoffman - 1964
5 Rangan, Connected domination and Steiner set on asteroidal triple-free graphs – H Balakrishnan, A - 1993
24 Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs – Derek G. Corneil, Stephan Olariu, Lorna Stewart - 1997
873 Parameterized Complexity – Rod G. Downey, Michael R. Fellows, Rolf Niedermeier, Peter Rossmanith, Rod G. Downey (wellington, New Zeal, Michael R. Fellows (newcastle, Rolf Niedermeier (tubingen, Peter Rossmanith (tu Munchen - 1998
84 A characterization of rigid circuit graphs – P Buneman - 1974