✦ LIBER ✦

A left-first search algorithm for planar graphs

✍ Scribed by H. de Fraysseix; P. O. de Mendez; J. Pach

Book ID: 110561016
Publisher: Springer
Year: 1995
Tongue: English
Weight: 553 KB
Volume: 13
Category: Article
ISSN: 0179-5376
DOI: 10.1007/bf02574056

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear-processor algorithm for depth-f

A linear-processor algorithm for depth-first search in planar graphs

✍ Gregory E. Shannon 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 458 KB

A general best first search algorithm in

A general best first search algorithm in AND/OR graphs

✍ P.P Chakrabarti; S Ghose 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 558 KB

An algorithm for drawing planar graphs

✍ Bor Plestenjak 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 382 KB 👁 2 views

A simple algorithm for drawing 3-connected planar graphs is presented. It is derived from the Fruchterman and Reingold spring embedding algorithm by deleting all repulsive forces and fixing vertices of an outer face. The algorithm is implemented in the system for manipulating discrete mathematical s

An algorithm for colouring perfect plana

An algorithm for colouring perfect planar graphs

✍ Iain A. Stewart 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 685 KB

A self-stabilizing algorithm for colorin

A self-stabilizing algorithm for coloring planar graphs

✍ Sukumar Ghosh; Mehmet Hakan Karaata 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 557 KB

A Multiterminal Minimum Cut Algorithm fo

A Multiterminal Minimum Cut Algorithm for Planar Graphs

✍ Shiloach, Yossi 📂 Article 📅 1980 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 628 KB