Sciweavers

ALGORITHMICA
2004
112views more  ALGORITHMICA 2004»
13 years 11 months ago
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs
Abstract. We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. LexBFS, a seminal algorithm for recognizing chordal graphs, was the genesis for ...
Anne Berry, Jean R. S. Blair, Pinar Heggernes, Bar...
DM
2006
92views more  DM 2006»
13 years 11 months ago
Minimal triangulations of graphs: A survey
Any given graph can be embedded in a chordal graph by adding edges, and the resulting chordal graph is called a triangulation of the input graph. In this paper we study minimal tr...
Pinar Heggernes