Ultimate generalizations of LexBFS and LEX M

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3787 LNCS, Issue , 2005, Pages 199-213

  Berry, Anne ^a   Krueger, Richard ^b   Simonet, Genevieve ^c  

^a UNIVERSITÉ BLAISE PASCAL   (France)

^b UNIVERSITY OF TORONTO   (Canada)

^c LIRMM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER SCIENCE; GRAPH THEORY;

GRAPH SEARCH ALGORITHMS; MEO-COMPUTING; MINIMAL TRIANGULATIONS; NON-CHORDAL GRAPH;

ALGORITHMS;

EID: 33744905350     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11604686_18     Document Type: Conference Paper

References (15)

1. A. Berry, J. Blair, P. Heggernes and B. Peyton. Maximum Cardinality Search for computing minimal triangulations of graphs. Algorithmica, 39(4):287-298, 2004.
2. A. Berry and J.-P. Bordat. Separability generalizes Dirac's theorem. Discrete Applied Mathematics, 84:43-53, 1998.
3. A. Berry and J.-P. Bordat. Moplex elimination orderings. Electronic Notes in Discrete Mathematics, Volume 8, 2001, Proceedings of First Cologne-Twente Workshop on Graphs and Combinatorial Optimization.
4. J. R. S. Blair, P. Heggernes, and J. A. Telle. A practical algorithm for making filled graphs minimal. Theoretical Computer Science A, 250-1/2: 125-141, 2001.
5. H. L. Bodlaender, A. M. G. A. Koster. On the Maximum Cardinality Search Lower Bound for Treewidth. Proceedings WG 2004, 81-92, 2004.
6. D. G. Corneil and R. Krueger. A unified view of graph searching. Submitted.
7. D. G. Corneil, S. Olariu, and L. Stewart. Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs. SIAM Journal on Computing, 28:1284-1297, 1999.
8. E. Dahinaus, P. L. Hammer, F. Maffray, and S. Olariu. On Domination Elimination Orderings and Domination Graphs. Proceedings of WG 1994, 81-92, 1994.
9. D.R. Fulkerson and O.A. Gross. Incidence matrixes and interval graphs. Pacific Journal of Math., 15:835-855, 1965.
10. T. Ohtsuki. A fast algorithm for finding an optimal ordering in the vertex elimination on a graph. SIAM Journal on Computing, 5:133-145, 1976.
11. T. Ohtsuki, L. K. Cheung, and T. Fujisawa. Minimal triangulation of a graph and optimal pivoting order in a sparse matrix. Journal of Math. Analysis and Applications, 54:622-633, 1976.
12. D. Rose, R.E. Tarjan, and G. Lueker. Algorithmic aspects of vertex elimination on graphs. SIAM Journ. Comput, 5:146-160, 1976.
13. D. R. Shier. Some aspects of perfect elimination orderings in chordal graphs. Discrete Applied Mathematics, 7:325-331, 1984.
14. R. E. Tarjan and M. Yannakakis. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput., 13:566-579, 1984.
15. Y. Villanger. Lex M versus MCS-M. to appear in a Special Issue of Discrete Mathematics, 2004.