✦ LIBER ✦

Tree Spanners for Bipartite Graphs and Probe Interval Graphs

✍ Scribed by Andreas Brandstadt; Feodor F. Dragan; Hoang-Oanh Le; Van Bang Le; Ryuhei Uehara

Publisher: Springer
Year: 2006
Tongue: English
Weight: 336 KB
Volume: 47
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-006-1209-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tree 3-spanners on interval, permutation

Tree 3-spanners on interval, permutation and regular bipartite graphs

✍ M.S. Madanlal; G. Venkatesan; C.Pandu Rangan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 481 KB

Recognizing edge clique graphs among int

Recognizing edge clique graphs among interval graphs and probe interval graphs

✍ Jing Kong; Yaokun Wu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 250 KB

The edge clique graph of a graph H is the one having the edge set of H as vertex set, two vertices being adjacent if and only if the corresponding edges belong to a common complete subgraph of H . We characterize the graph classes {edge clique graphs} ∩ {interval graphs} as well as {edge clique grap

Tree spanners on chordal graphs: complex

Tree spanners on chordal graphs: complexity and algorithms

✍ Andreas Brandstädt; Feodor F. Dragan; Hoàng-Oanh Le; Van Bang Le 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 329 KB

A tree t-spanner T in a graph G is a spanning tree of G such that the distance in T between every pair of vertices is at most t times their distance in G. The TREE t-SPANNER problem asks whether a graph admits a tree t-spanner, given t. We substantially strengthen the hardness result of Cai and Corn

Optimal tree 3-spanners in directed path

Optimal tree 3-spanners in directed path graphs

✍ Le, Ho�ng-Oanh; Le, Van Bang 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB 👁 2 views

In a graph G, a spanning tree T is called a tree t-spanner of G if the distance between any two vertices in T is at most t times their distance in G. While the complexity of finding a tree t-spanner of a given graph is known for any fixed t 3, the case t ϭ 3 still remains open. In this article, we s

On tree 3-spanners in directed path grap

On tree 3-spanners in directed path graphs

✍ B.S. Panda; Anita Das 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB

Metric characterizations of proper inter

Metric characterizations of proper interval graphs and tree-clique graphs

✍ Gutierrez, M.; Oubi�a, L. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 393 KB 👁 2 views

A connected graph G is a tree-clique graph if there exists a spanning tree T (a compatible tree) such that every clique of G is a subtree of T. When Tis a path the connected graph G is a proper interval graph which is usually defined as intersection graph of a family of closed intervals of the real