✦ LIBER ✦

Linear time recognition of Weak bisplit graphs

✍ Scribed by Vassilis Giakoumakis; Jean-Marie Vanherpe

Book ID: 108498121
Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 273 KB
Volume: 5
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)80146-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the recognition of bisplit gra

A note on the recognition of bisplit graphs

✍ Atif Abueida; R. Sritharan 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 138 KB

Linear-Time Recognition of Circular-Arc

Linear-Time Recognition of Circular-Arc Graphs

✍ Ross M. McConnell 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 472 KB

Simple linear time recognition of unit i

Simple linear time recognition of unit interval graphs

✍ Derek G Corneil; Hiryoung Kim; Sridhar Natarajan; Stephan Olariu; Alan P Sprague 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 560 KB

Linear-time recognition of bipartite gra

Linear-time recognition of bipartite graphs plus two edges

✍ Peter Damaschke 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 137 KB

A linear time recognition algorithm for

A linear time recognition algorithm for proper interval graphs

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

We propose a linear time recognition algorithm for proper interval graphs. The algorithm is based on certain ordering of vertices, called bicompatible elimination ordering (BCO). Given a BCO of a biconnected proper interval graph G, we also propose a linear time algorithm to construct a Hamiltonian

Linear-Time Recognition of Helly Circula

Linear-Time Recognition of Helly Circular-Arc Models and Graphs

✍ Benson L. Joeris; Min Chih Lin; Ross M. McConnell; Jeremy P. Spinrad; Jayme L. S 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 652 KB