Graph extremities defined by search algorithms

Algorithms

Volumn 3, Issue 2, 2010, Pages 100-124

  Berry, Anne ^a   Blair, Jean R S ^b   Bordat, Jean Paul ^c   Simonet, Geneviéve ^c  

^a UNIVERSITÉ BLAISE PASCAL   (France)

^b UNITED STATES MILITARY ACADEMY   (United States)

^c LIRMM   (France)

Author keywords

Graph extremity; Graph search; LexBFS; MCS; MLS

Indexed keywords

EID: 79953761178     PISSN: None     EISSN: 19994893     Source Type: Journal    
DOI: 10.3390/a3020100     Document Type: Article

References (22)

1. Dirac, G.A. On rigid circuit graphs. PAbh. Math. Sem. Univ. Hamburg 1961, 25, 71-76.
2. Lekkerkerker, C.; Boland, J. Representation of a finite graph by a set of intervals on real line. Fund. Math. 1962, 51, 45-64.
3. Fulkerson, D.R.; Gross, O.A. Incidence matrixes and interval graphs. Pac. J. Math. 1965, 15, 835-855.
4. Rose, D.; Tarjan, R.E.; Lueker, G. Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 1976, 5, 146-160.
5. Tarjan, R.E.; Yannakakis, M. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 1984, 13, 566-579.
6. Dahlhaus, E; Hammer, P.L.; Maffray, F.; Olariu, S. On domination elimination orderings and domination graphs. In Proceedings of WG'94, Herrsching, Germany, June 1994; pp. 81-92.
7. Corneil, D.G.; Olariu, S.; Stewart L. Asteroidal triple free graphs. SIAM J. Discrete Math. 1997, 10, 399-430.
8. Corneil, D.G.; Olariu, S; Stewart, L. Linear time algorithms for dominating pairs in asteroidal triple-free graphs. SIAM J. Comput. 1999, 28, 1284-1297.
9. Brandstdt, A.; Dragan, F.F.; Nicolai, F. LexBFS-orderings and powers of chordal graphs. Discrete Math. 1997, 171, 27-42.
10. Dragan, F.F.; Nicolai, F. LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem. Discrete Appl. Math.2000, 98, 191-207.
11. Corneil, D.; Krueger, R. A unified view of graph searching. SIAM J. Disc. Math. 2008, 22, 1259-1276.
12. Berry, A.; Krueger, R.; Simonet, G. Maximal label search algorithms to compute perfect and minimal elimination orderings. SIAM J. Discrete Math. 2009, 23, 428-446.
13. Berry, A.; Bordat, J.P. Separability generalizes Dirac's theorem. Discrete Appl. Math. 1998, 84, 43-53.
14. Blair, J.R.S.; Peyton, B.W. An introduction to chordal graphs and clique trees. In Graph Theory and Sparse Matrix Computations; George J.A., Gilbert J.R., Liu W.H., Eds; Springer Verlag: Berlin, Germany, 1993; Volume 56, pp. 1-30.
15. Ohtsuki, T.; Cheung, L.K.; Fujisawa, T. Minimal triangulation of a graph and optimal pivoting ordering in a sparse matrix. J. Math. Anal. Appl. 1976, 54, 622-633.
16. Berry, A.; Blair, J.R.S.; Heggernes, P.; Peyton, B. Maximum Cardinality Search for computing minimal triangulations of graphs. Algorithmica 2004, 39, 287-298.
17. Berry, A.; Bordat, J.P. Moplex elimination orderings. In Proceedings of First Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Cologne, Germany, June 2001; Volume 8.
18. Berry, A.; Bordat, J.P.; Heggernes P. Recognizing weakly chordal graphs by edge separability. Nordic J. Comput. 2000, 7, 164-177.
19. Berry, A.; Bordat, J.P.; Heggernes, P.; Simonet G.; Villanger, Y. A wide-range algorithm for minimal triangulation from an arbitrary ordering. J. Algorithm 2006, 58, 33-66.
20. Lanlignel, J.M. Autour de la décomposition en coupes. PhD Thesis, LIRMM: Montpellier, France, 2001.
21. Rose, D. Triangulated graphs and the elimination process. J. Math. Anal. Appl. 1970, 32, 597-609
22. Berry, A.; Blair, J.R.S.; Bordat, J.P.; Krueger, R.; Simonet, G. Extremities and orderings defined by generalized graph search algorithms. In Proceedings of 7th International Colloquium on Graph Theory: ICGT'05, Hyeres, France, September 2005; pp. 413-420.