✦ LIBER ✦

Random generation and enumeration of bipartite permutation graphs

✍ Scribed by Toshiki Saitoh; Yota Otachi; Katsuhisa Yamanaka; Ryuhei Uehara

Book ID: 113699067
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 321 KB
Volume: 10
Category: Article
ISSN: 1570-8667
DOI: 10.1016/j.jda.2011.11.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The enumeration of bipartite graphs

✍ Phil Hanlon 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 210 KB

Enumeration of Bipartite Self-Complement

Enumeration of Bipartite Self-Complementary Graphs

✍ Makoto Ueno, Shinsei Tazawa 📂 Article 📅 2012 🏛 Springer Japan 🌐 English ⚖ 156 KB

Edge domination on bipartite permutation

Edge domination on bipartite permutation graphs and cotriangulated graphs

✍ Anand Srinivasan; K. Madhukar; P. Nagavamsi; C.Pandu Rangan; Maw-Shang Chang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 638 KB

Diameters of random bipartite graphs

✍ Béla Bollobás; Victor Klee 📂 Article 📅 1984 🏛 Springer-Verlag 🌐 English ⚖ 485 KB

Efficient parallel algorithms for bipart

Efficient parallel algorithms for bipartite permutation graphs

✍ Lin Chen; Yaacov Yesha 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 858 KB

## Abstract In this paper, we further study the properties of bipartite permutation graphs. We give first efficient parallel algorithms for several problems on bipartite permutation graphs. These problems include transforming a bipartite graph into a strongly ordered one if it is also a permutation

Canonical Antichains of Unit Interval an

Canonical Antichains of Unit Interval and Bipartite Permutation Graphs

✍ Vadim V. Lozin; Colin Mayhill 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 268 KB