✦ LIBER ✦

On the complexity of paths avoiding forbidden pairs

✍ Scribed by Petr Kolman; Ondřej Pangrác

Book ID: 108112814
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 413 KB
Volume: 157
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2009.03.018

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On paths avoiding forbidden pairs of ver

On paths avoiding forbidden pairs of vertices in a graph

✍ Hananya Yinnone 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 473 KB

Self-avoiding paths on the pre-Sierpinsk

Self-avoiding paths on the pre-Sierpinski gasket

✍ Kumiko Hattori; Tetsuya Hattori; Shigeo Kusuoka 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 881 KB

On the complexity of the disjoint paths

On the complexity of the disjoint paths problem

✍ Matthias Middendorf; Frank Pfeiffer 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 554 KB

On pairs of non-crossing generalized Dyc

On pairs of non-crossing generalized Dyck paths

✍ Jacques Labelle 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 451 KB

On the complexity of finding paths in a

On the complexity of finding paths in a two-dimensional domain I: Shortest paths

✍ Arthur W. Chou; Ker-I Ko 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 342 KB 👁 2 views

## Abstract The computational complexity of finding a shortest path in a two‐dimensional domain is studied in the Turing machine‐based computational model and in the discrete complexity theory. This problem is studied with respect to two formulations of polynomial‐time computable two‐dimensional do

A new upper bound on the complexity of t

A new upper bound on the complexity of the all pairs shortest path problem

✍ Tadao Takaoka 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 262 KB