✦ LIBER ✦

Motorcycle Graphs and Straight Skeletons

✍ Scribed by Siu-Wing Cheng; Antoine Vigneron

Book ID: 106148713
Publisher: Springer
Year: 2007
Tongue: English
Weight: 321 KB
Volume: 47
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-006-1229-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Digital straightness and the skeleton pr

Digital straightness and the skeleton property

✍ Yazid M. Sharaiha; Philippe Garat 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 508 KB

Quickest Paths, Straight Skeletons, and

Quickest Paths, Straight Skeletons, and the City Voronoi Diagram

✍ Oswin Aichholzer; Franz Aurenhammer; Belén Palop 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 219 KB

Straight-Line Drawing Algorithms for Hie

Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs

✍ Peter Eades; Qingwen Feng; Xuemin Lin; Hiroshi Nagamochi 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 422 KB

Coordinating Heterogeneous Parallel Syst

Coordinating Heterogeneous Parallel Systems with Skeletons and Activity Graphs

✍ Murray Cole; Andrea Zavanella 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 273 KB

On the Spanning Ratio of Gabriel Graphs

On the Spanning Ratio of Gabriel Graphs and beta-Skeletons

✍ Bose, Prosenjit; Devroye, Luc; Evans, William; Kirkpatrick, David 📂 Article 📅 2006 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 250 KB

Dependent edges in Mycielski graphs and

Dependent edges in Mycielski graphs and 4-colorings of 4-skeletons

✍ Karen L. Collins; Kimberly Tysdal 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 174 KB 👁 1 views

## Abstract A dependent edge in an acyclic orientation of a graph is one whose reversal creates a directed cycle. In answer to a question of Erdös, Fisher et al. [5] define __d__~min~(__G__) to be the minimum number of dependent edges of a graph __G__, where the minimum is taken over all acyclic or