✦ LIBER ✦

How to Guard a Graph?

✍ Scribed by Fedor V. Fomin; Petr A. Golovach; Alex Hall; Matúš Mihalák; Elias Vicari; Peter Widmayer

Publisher: Springer
Year: 2010
Tongue: English
Weight: 611 KB
Volume: 61
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-009-9382-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

How to make a graph bipartite

✍ Paul Erdös; Ralph Faudree; János Pach; Joel Spencer 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 678 KB

How to make a graph four-connected

✍ Ervin Győri; Tibor Jordán 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 92 KB

How to draw a planar graph on a grid

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

How to build an interference graph

✍ Keith D. Cooper; Timothy J. Harvey; Linda Torczon 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

The design and implementation of an interference graph is critical to the performance of a graphcoloring register allocator. The cost of constructing and manipulating the interference graph dominates the overall cost of allocation. The literature on graph-coloring register allocation suggests the us

How to determine the maximum genus of a

How to determine the maximum genus of a graph

✍ Nguyen Huy Xuong 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 477 KB

How to compute the Wiener index of a gra

How to compute the Wiener index of a graph

✍ Bojan Mohar; Toniaž Pisanski 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 514 KB