Efficient Exact Paths For Dyck and semi-Dyck Labeled Path Reachability

The exact path length problem is to determine if there is a path of a given fixed cost between two vertices. This paper focuses on the exact path problem for costs \(-1,0\) or \(+1\) between all pairs of vertices in an edge-weighted digraph. The edge weights are from \(\{ -1, +1 \}\). In this case,...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2018-03
1. Verfasser:	Bradford, Phillip G
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Apexes Freeware Graph theory Multiplication Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!