✦ LIBER ✦

The parametric complexity of graph diameter augmentation

✍ Scribed by Gao, Yong; Hare, Donovan R.; Nastos, James

Book ID: 123509895
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 383 KB
Volume: 161
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.01.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Augmenting Graphs to Minimize the Diamet

Augmenting Graphs to Minimize the Diameter

✍ Frati, Fabrizio; Gaspers, Serge; Gudmundsson, Joachim; Mathieson, Luke 📂 Article 📅 2014 🏛 Springer 🌐 English ⚖ 534 KB

The Complexity of Pebbling in Diameter T

The Complexity of Pebbling in Diameter Two Graphs

✍ Cusack, Charles A.; Lewis, Timothy; Simpson, Daniel; Taggart, Samuel 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 210 KB

Complexity of approximating the oriented

Complexity of approximating the oriented diameter of chordal graphs

✍ Fedor V. Fomin; Martín Matamala; Ivan Rapaport 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

## Abstract The oriented diameter of a bridgeless connected undirected (__bcu__) graph __G__ is the smallest diameter among all the diameters of strongly connected orientations of __G__. We study algorithmic aspects of determining the oriented diameter of a chordal graph. We (a) construct a linear‐

The Complexity of Graph Pebbling

✍ Milans, Kevin; Clark, Bryan 📂 Article 📅 2006 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 343 KB

The generalized diameter of a graph

✍ Chih-Kang Eric Chen; R. S. Garfinkel 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB

## Abstract We generalize the concept of the diameter of a graph __G__ = (__N, A__) to allow for location of points not on the nodes. It is shown that there exists a finite set of candidate points which determine this __generalized diameter.__ Given the matrix of shortest paths, an __o__ (|__A__|^2

The diameter of directed graphs

✍ Peter Dankelmann 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 152 KB