✦ LIBER ✦

A linear algorithm for bipartition of biconnected graphs

✍ Scribed by Hitoshi Suzuki; Naomi Takahashi; Takao Nishizeki

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 343 KB
Volume: 33
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(90)90189-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear algorithm for centering a spann

A linear algorithm for centering a spanning tree of a biconnected graph

✍ K.S. Easwarakumar; C.Pandu Rangan; G.A. Cheston 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 381 KB

A simple linear-time algorithm for the r

A simple linear-time algorithm for the recognition of bandwidth-2 biconnected graphs

✍ Fillia Makedon; Dafna Sheinwald; Yaron Wolfsthal 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 382 KB

A self-stabilizing algorithm for colorin

A self-stabilizing algorithm for coloring bipartite graphs

✍ Sumit Sur; Pradip K. Srimani 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 566 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

An efficient distributed algorithm for c

An efficient distributed algorithm for centering a spanning tree of a biconnected graph

✍ R.F.M. Aranha; C.Pandu Rangan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 537 KB

A linear time algorithm for the Bottlene

A linear time algorithm for the Bottleneck Biconnected Spanning Subgraph problem

✍ Gurmeet Singh Manku 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 621 KB