✦ LIBER ✦

Planar and Grid Graph Reachability Problems

✍ Scribed by Eric Allender; David A. Mix Barrington; Tanmoy Chakraborty; Samir Datta; Sambuddha Roy

Publisher: Springer
Year: 2009
Tongue: English
Weight: 895 KB
Volume: 45
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-009-9172-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reachability Problems on Regular Ground

Reachability Problems on Regular Ground Tree Rewriting Graphs

✍ Christof Löding 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 471 KB

How to draw a planar graph on a grid

✍ H. Fraysseix; J. Pach; R. Pollack 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 652 KB

Simultaneous Embedding of a Planar Graph

Simultaneous Embedding of a Planar Graph and Its Dual on the Grid

✍ Cesim Erten; Stephen G. Kobourov 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 235 KB

Planar lattices and planar graphs

✍ C.R Platt 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 487 KB

A linear-time algorithm for drawing a pl

A linear-time algorithm for drawing a planar graph on a grid

✍ M. Chrobak; T.H. Payne 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 523 KB

Two-Connected Augmentation Problems in P

Two-Connected Augmentation Problems in Planar Graphs

✍ J.Scott Provan; Roger C Burk 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 167 KB

Given a weighted undirected graph G and a subgraph S of G, we consider the problem of adding a minimum-weight set of edges of G to S so that the resulting Ž . subgraph satisfies specified edge or vertex connectivity requirements between pairs of nodes of S. This has important applications in upgradi