✦ LIBER ✦

-separators in planar graphs

✍ Scribed by S.A. Tishchenko

Book ID: 113582390
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 541 KB
Volume: 33
Category: Article
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2011.09.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding short cycles in planar graphs us

Finding short cycles in planar graphs using separators

✍ Dana Richards 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 635 KB

Edge Separators of Planar and Outerplana

Edge Separators of Planar and Outerplanar Graphs With Applications

✍ K. Diks; H.N. Djidjev; O. Sykora; I. Vrto 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 816 KB

Finding small simple cycle separators fo

Finding small simple cycle separators for 2-connected planar graphs

✍ Gary L. Miller 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 1007 KB

Separating double rays in locally finite

Separating double rays in locally finite planar graphs

✍ C Paul Bonnington; Wilfried Imrich; Mark E Watkins 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 765 KB

The main aim of this paper is to characterize infinite, locally finite, planar, l-ended graphs by means of path separation properties. Let r be an infinite graph, let I7 be a double ray in r, and let d and d, denote the distance functions in r and in n, respectively. One calls II a quasi-axis if lim

Minimal separators in extended -laden gr

Minimal separators in extended -laden graphs

✍ Vagner Pedrotti; Célia Picinin de Mello 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 242 KB

I/O-Efficient Planar Separators

✍ Maheshwari, Anil; Zeh, Norbert 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 602 KB