✦ LIBER ✦

Linear-time recognition of bipartite graphs plus two edges

✍ Scribed by Peter Damaschke

Book ID: 108315788
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 137 KB
Volume: 262
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(02)00493-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear-Time Recognition of Circular-Arc

Linear-Time Recognition of Circular-Arc Graphs

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

Linear time recognition of Weak bisplit

Linear time recognition of Weak bisplit graphs

✍ Vassilis Giakoumakis; Jean-Marie Vanherpe 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 273 KB

Linear-time optimal augmentation for com

Linear-time optimal augmentation for componentwise bipartite-completeness of graphs

✍ Ming-Yang Kao 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 499 KB

Computing the Cutwidth of Bipartite Perm

Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time

✍ Heggernes, Pinar; van 't Hof, Pim; Lokshtanov, Daniel; Nederlof, Jesper 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 283 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 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