✦ LIBER ✦

An algorithm for drawing general undirected graphs

✍ Scribed by Tomihisa Kamada; Satoru Kawai

Book ID: 113163397
Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 943 KB
Volume: 31
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(89)90102-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for generating minimal cuts

An algorithm for generating minimal cutsets of undirected graphs

✍ Shin, Yong Yeon ;Koh, Jai Sang 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 250 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 determining the automor

An algorithm for determining the automorphism partitioning of an undirected graph

✍ D. G. Corneil 📂 Article 📅 1972 🏛 Springer Netherlands 🌐 English ⚖ 563 KB

An Optimal Algorithm for Scanning All Sp

An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs

✍ Shioura, Akiyoshi; Tamura, Akihisa; Uno, Takeaki 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 366 KB

A Flexible Algorithm for Generating All

A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs

✍ T. Matsui 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 130 KB

An Algorithm for Straight-Line Drawing o

An Algorithm for Straight-Line Drawing of Planar Graphs

✍ D. Harel; M. Sardas 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 200 KB