✦ LIBER ✦

An Edge-Splitting Algorithm in Planar Graphs

✍ Scribed by Hiroshi Nagamochi; Peter Eades

Book ID: 111542465
Publisher: Springer US
Year: 2003
Tongue: English
Weight: 225 KB
Volume: 7
Category: Article
ISSN: 1382-6905
DOI: 10.1023/a:1024470929537

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast algorithms for edge-coloring planar

Fast algorithms for edge-coloring planar graphs

✍ Marek Chrobak; Moti Yung 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 963 KB

Improved edge-coloring algorithms for pl

Improved edge-coloring algorithms for planar graphs

✍ Marek Chrobak; Takao Nishizeki 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 808 KB

A SimplifiedÕ(nm)Time Edge-Splitting Alg

A SimplifiedÕ(nm)Time Edge-Splitting Algorithm in Undirected Graphs

✍ H. Nagamochi; S. Nakamura; T. Ibaraki 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 141 KB

Optimal algorithms for computing edge we

Optimal algorithms for computing edge weights in planar split networks

✍ Vincent Moulton; Andreas Spillner 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 577 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

Edge-Packing in Planar Graphs

✍ L. S. Heath; J. P. C. Vergara 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 396 KB