Sciweavers

2294 search results - page 7 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
TCS
2002
13 years 8 months ago
Streams and strings in formal proofs
Streams are acyclic directed subgraphs of the logical ow graph of a proof representing bundles of paths with the same origin and the same end. The notion of stream is used to desc...
Alessandra Carbone
GG
2004
Springer
14 years 2 months ago
Composition of Path Transductions
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutio...
Tanguy Urvoy
TON
2012
11 years 11 months ago
Independent Directed Acyclic Graphs for Resilient Multipath Routing
—In order to achieve resilient multipath routing we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) in this study. Link-independent (Node-independent) DAGs s...
Sangman Cho, Theodore Elhourani, Srinivasan Ramasu...
SODA
2010
ACM
231views Algorithms» more  SODA 2010»
14 years 6 months ago
Asymmetric Traveling Salesman Path and Directed Latency Problems
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
Zachary Friggstad, Mohammad R. Salavatipour, Zoya ...