✦ LIBER ✦

A linear expected-time algorithm for computing planar relative neighbourhood graphs

✍ Scribed by Jyrki Katajainen; Olli Nevalainen; Jukka Teuhola

Book ID: 113163150
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 713 KB
Volume: 25
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(87)90225-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On linear-time algorithms for five-color

On linear-time algorithms for five-coloring planar graphs

✍ Greg N. Frederickson 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 530 KB

New Linear-Time Algorithms for Edge-Colo

New Linear-Time Algorithms for Edge-Coloring Planar Graphs

✍ Richard Cole; Łukasz Kowalik 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 457 KB

A linear-time algorithm for four-partiti

A linear-time algorithm for four-partitioning four-connected planar graphs

✍ Shin-ichi Nakano; Md.Saidur Rahman; Takao Nishizeki 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 765 KB

In this paper we give a simple linear-time algorithm to find such a partition if G is a 4-connected planar graph and ~1. ~2. 143 and u4 are located on the same face of a plane embedding of G. Our algorithm is based on a "4canonical decomposition" of G, which is a generalization of an St-numbering an

A linear-time algorithm for edge-disjoin

A linear-time algorithm for edge-disjoint paths in planar graphs

✍ Dorothea Wagner; Karsten Weihe 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 1007 KB

A linear-time algorithm for drawing a pl

A linear-time algorithm for drawing a planar graph on a grid

✍ M. Chrobak; T.H. Payne 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 523 KB

A linear time algorithm for the induced

A linear time algorithm for the induced disjoint paths problem in planar graphs

✍ Ken-ichi Kawarabayashi; Yusuke Kobayashi 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 259 KB