𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithms for weakly triangulated graphs

✍ Scribed by Jeremy Spinrad; R. Sritharan


Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
680 KB
Volume
59
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Generating weakly triangulated graphs
✍ Hayward, Ryan πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 192 KB πŸ‘ 2 views

We show that a graph is weakly triangulated, or weakly chordal, if and only if it can be generated by starting with a graph with no edges, and repeatedly adding an edge, so that the new edge is not the middle edge of any chordless path with four vertices. This is a corollary of results due to Sritha

Meyniel weakly triangulated graphs β€” I:
✍ Ryan B. Hayward πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 872 KB

We show that Ps-free weakly triangulated graphs are perfectly orderable. Our proof is algorithmic, and relies on a notion concerning separating sets, a property of weakly triangulated graphs, and several properties of Ps-free weakly triangulated graphs.

Meyniel weakly triangulated graphs II: A
✍ Ryan B. Hayward πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 477 KB

WC gcneralizc a theorem due to Dirac and show that every Mcyniel weakly triangulated graph has some vertex which is not the middle vertex of any P;. Our main tool is a separating set notion known as a handle. 01997 Elsevicr Science B.V. k'c,~~ortl.s:

A Simple Linear Time Algorithm for Trian
✍ H. Bodlaender; T. Kloks πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 560 KB

In this paper we consider the problem of determining whether a given colored graph can be triangulated, such that no edges between vertices of the same color are added. This problem originated from the perfect phylogeny problem from molecular biology and is strongly related with the problem of recog