✦ LIBER ✦

Robust Computation of Intersection Graph between Two Solids

✍ Scribed by Hiroyuki Nakamura; Masatake Higashi; Mamoru Hosaka

Book ID: 114674216
Publisher: John Wiley and Sons
Year: 1997
Tongue: English
Weight: 144 KB
Volume: 16
Category: Article
ISSN: 0167-7055
DOI: 10.1111/1467-8659.00144

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Robust Computation of Intersection Graph

Robust Computation of Intersection Graph between Two Solids

✍ Hiroyuki Nakamura; Masatake Higashi; Mamoru Hosaka 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 148 KB

Intersection number of two connected geo

Intersection number of two connected geometric graphs

✍ Shin-ichi Tokunaga 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 285 KB

An inequality between intersection numbe

An inequality between intersection numbers of a distance-regular graph

✍ Kazumasa Nomura 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 82 KB

Two Models of Random Intersection Graphs

Two Models of Random Intersection Graphs and their Applications

✍ Erhard Godehardt; Jerzy Jaworski 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 214 KB

On the stability number of the edge inte

On the stability number of the edge intersection of two graphs

✍ Claudio Arbib; Alberto Caprara 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 38 KB

Let G be the graph obtained as the edge intersection of two graphs G 1 , G 2 on the same vertex set V . We show that if at , where α() is the cardinality of the largest stable set. Moreover, for general G 1 and G 2 , we show that α(G) R(α(G 1 ) + 1, α(G 2 ) + 1) -1, where R(k, ) is the Ramsey numbe

On minimum intersection of two minimum d

On minimum intersection of two minimum dominating sets of interval graphs

✍ Chang Maw-Shang; Hsu Chung-Chang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 748 KB

This paper gives linear-time algorithms for finding two minimum (connected) dominating sets with minimum intersection for interval graphs.