✦ LIBER ✦

Algorithms for the edge-width of an embedded graph

✍ Scribed by Sergio Cabello; Éric Colin de Verdière; Francis Lazarus

Book ID: 113550915
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 244 KB
Volume: 45
Category: Article
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2011.12.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Linear Algorithm for Finding the Invar

A Linear Algorithm for Finding the Invariant Edges of an Edge-Weighted Graph

✍ Malvestuto, F. M.; Mezzini, M. 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 199 KB

An Efficient Algorithm for Embedding Non

An Efficient Algorithm for Embedding Nonplanar Graphs in Planes

✍ A. Kaveh; H. Rahami 📂 Article 📅 2002 🏛 Springer Netherlands 🌐 English ⚖ 163 KB

Efficient Parallel Algorithms for Graphs

Efficient Parallel Algorithms for Graphs of Bounded Tree-Width

✍ Jens Lagergren 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 236 KB

We present an efficient parallel algorithm for the tree-decomposition problem Ž 3 . Ž. for fixed width w. The algorithm runs in time O O log n and uses O O n processors on an ARBITRARY CRCW PRAM. The sequential complexity of our tree-decom-Ž 2 . position algorithm is O O n log n . The tree-decomposi

A Linear Time Algorithm for Embedding Gr

A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface

✍ Mohar, Bojan 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 413 KB

On the edge reconstruction of graphs emb

On the edge reconstruction of graphs embedded on surfaces

✍ Yue Zhao 📂 Article 📅 1993 🏛 Springer Japan 🌐 English ⚖ 217 KB

An algorithm for 1-bend embeddings of pl

An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid

✍ Aurora Morgana; Célia Picinin de Mello; Giovanna Sontacchi 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 491 KB

In this paper we characterize the class of plane graphs that can be embedded on the twodimensional grid with at most one bend on each edge. In addition, we provide an algorithm that either detects a forbidden conÿguration or generates an embedding with at most one bend on each edge.