✦ LIBER ✦

A characterization of signed graphs with generalized perfect elimination orderings

✍ Scribed by Koji Nuida

Book ID: 108114191
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 900 KB
Volume: 310
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2009.09.019

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generating and characterizing the perfec

Generating and characterizing the perfect elimination orderings of a chordal graph

✍ L.S. Chandran; L. Ibarra; F. Ruskey; J. Sawada 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 402 KB

We develop a constant time transposition "oracle" for the set of perfect elimination orderings of chordal graphs. Using this oracle, we can generate a Gray code of all perfect elimination orderings in constant amortized time using known results about antimatroids. Using clique trees, we show how the

New linear time algorithms for generatin

New linear time algorithms for generating perfect elimination orderings of chordal graphs

✍ B.S. Panda 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 374 KB

Computation of a (canonical) doubly perf

Computation of a (canonical) doubly perfect elimination ordering of a doubly chordal graph

✍ Lee, Mahnhoon ;Kim, Changhwa 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 119 KB

Computing a perfect edge without vertex

Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph

✍ T. Kloks; D. Kratsch 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 473 KB

A parallel algorithm for generating bico

A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs

✍ B.S. Panda; Sajal K. Das 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 182 KB

A Characterization of Cubic Graphs with

A Characterization of Cubic Graphs with Paired-Domination Number Three-Fifths Their Order

✍ Wayne Goddard; Michael A. Henning 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 568 KB