✦ LIBER ✦

Crossing minimization in linear embeddings of graphs

✍ Scribed by Masuda, S.; Nakajima, K.; Kashiwabara, T.; Fujisawa, T.

Book ID: 119772398
Publisher: IEEE
Year: 1990
Tongue: English
Weight: 437 KB
Volume: 39
Category: Article
ISSN: 0018-9340
DOI: 10.1109/12.46286

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Arc Crossing Minimization in Graphs with

Arc Crossing Minimization in Graphs with GRASP

✍ Rafael Martí 📂 Article 📅 2001 🏛 Taylor and Francis Group 🌐 English ⚖ 241 KB

Linear embeddings of simple graphs in ℝ3

✍ E. N. Glushak 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 247 KB

Minimally knotted embeddings of planar g

Minimally knotted embeddings of planar graphs

✍ Ying-Qing Wu 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 French ⚖ 327 KB

Embedding rectilinear graphs in linear t

Embedding rectilinear graphs in linear time

✍ Frank Hoffmann; Klaus Kriegel 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 393 KB

The Number of Embeddings of Minimally Ri

The Number of Embeddings of Minimally Rigid Graphs

✍ Ciprian Borcea; Ileana Streinu 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 241 KB

Nearly light cycles in embedded graphs a

Nearly light cycles in embedded graphs and crossing-critical graphs

✍ Mario Lomelí; Gelasio Salazar 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB

## Abstract We find a lower bound for the proportion of face boundaries of an embedded graph that are nearly light (that is, they have bounded length and at most one vertex of large degree). As an application, we show that every sufficiently large __k__‐crossing‐critical graph has crossing number a