23 search results - page 1 / 5 » Minimal triangulations of graphs: A survey |
DM
2006
14 years 10 months ago
2006
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...
87
Voted
JAL
2006
14 years 10 months ago
2006
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
100
Voted
TCS
2008
14 years 10 months ago
2008
1 Elimination Game is a well known algorithm that simulates Gaussian elimination of matrices on graphs, and it computes a triangulation of the input graph. The number of fill edge...
78
Voted
ALGORITHMICA
2004
14 years 10 months ago
2004
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 ...
95
Voted
COMPGEOM
2006
ACM
15 years 4 months ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...