메뉴 건너뛰기




Volumn 22, Issue , 2005, Pages 413-420

Extremities and orderings defined by generalized graph search algorithms

Author keywords

graph search; LEX M; LexBFS; MCS; meo; minimal separator; moplex; peo

Indexed keywords


EID: 34247393705     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2005.06.066     Document Type: Article
Times cited : (4)

References (10)
  • 1
    • 21044444304 scopus 로고    scopus 로고
    • Maximum Cardinality Search for computing minimal triangulations of graphs
    • Berry A., Blair J., Heggernes P., and Peyton B. Maximum Cardinality Search for computing minimal triangulations of graphs. Algorithmica 39 4 (2004) 287-298
    • (2004) Algorithmica , vol.39 , Issue.4 , pp. 287-298
    • Berry, A.1    Blair, J.2    Heggernes, P.3    Peyton, B.4
  • 3
    • 52549132952 scopus 로고    scopus 로고
    • Moplex elimination orderings
    • Proceedings of First Cologne-Twente Workshop on Graphs and Combinatorial Optimization
    • Berry A., and Bordat J.-P. Moplex elimination orderings. Electronic Notes in Discrete Mathematics 8 (2001) Proceedings of First Cologne-Twente Workshop on Graphs and Combinatorial Optimization
    • (2001) Electronic Notes in Discrete Mathematics , vol.8
    • Berry, A.1    Bordat, J.-P.2
  • 4
    • 33744905350 scopus 로고    scopus 로고
    • Berry, A., R. Krueger, and G. Simonet, Ultimate generalizations of LexBFS and LEX M, to appear in LNCS proceedings of WG 2005
  • 5
    • 34247371881 scopus 로고    scopus 로고
    • Corneil, D. and R. Krueger, A unified view of graph searching, submitted
  • 7
    • 0345803292 scopus 로고
    • Algorithmic aspects of vertex elimination on graphs
    • Rose D., Tarjan R.E., and Lueker G. Algorithmic aspects of vertex elimination on graphs. SIAM Journ. Comput. 5 (1976) 146-160
    • (1976) SIAM Journ. Comput. , vol.5 , pp. 146-160
    • Rose, D.1    Tarjan, R.E.2    Lueker, G.3
  • 8
    • 0021389350 scopus 로고
    • Some aspects of perfect elimination orderings in chordal graphs
    • Shier D.R. Some aspects of perfect elimination orderings in chordal graphs. Discrete Applied Mathematics 7 (1984) 325-331
    • (1984) Discrete Applied Mathematics , vol.7 , pp. 325-331
    • Shier, D.R.1
  • 9
    • 0021473698 scopus 로고
    • Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs
    • Tarjan R.E., and Yannakakis M. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13 (1984) 566-579
    • (1984) SIAM J. Comput. , vol.13 , pp. 566-579
    • Tarjan, R.E.1    Yannakakis, M.2
  • 10
    • 34247367232 scopus 로고    scopus 로고
    • Villanger, Y., Lex M versus MCS-M, to appear in a Special Issue of Discrete Mathematics, 2004


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.