𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Planar graph routing on geographical clusters

✍ Scribed by Hannes Frey; Daniel Görgen

Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
420 KB
Volume
3
Category
Article
ISSN
1570-8705

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cluster fault-tolerant routing in star g
Cluster fault-tolerant routing in star graphs
✍ Gu, Qian-Ping; Peng, Shietung 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 2 views

Fault-tolerant routing is a key issue in computer/ communication networks. We say a network (graph) can tolerate l faulty nodes for a routing problem if after removing at most l arbitrary faulty nodes from the graph the routing paths exist for the routing problem. However, the bound l is usually a w

On cleaving a planar graph
On cleaving a planar graph
✍ Shankar M. Venkatesan 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 423 KB
On-line Planar Graph Embedding
On-line Planar Graph Embedding
✍ Roberto Tamassia 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 504 KB

We present a dynamic data structure for the incremental construction of a planar embedding of a planar graph. The data structure supports the following Ž . operations: i testing if a new edge can be added to the embedding without Ž . introducing crossing; and ii adding vertices and edges. The time c

On planar hypohamiltonian graphs
On planar hypohamiltonian graphs
✍ Gábor Wiener; Makoto Araya 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB

We present a planar hypohamiltonian graph on 42 vertices and (as a corollary) a planar hypotraceable graph on 162 vertices, improving the bounds of Zamfirescu and Zamfirescu and show some other consequences. We also settle the open problem whether there exists a positive integer N, such that for eve