2294 search results - page 12 / 459 » From Path Graphs to Directed Path Graphs |
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t be two distinct faces of G; let s1, . . . , sk be vertices incident wi...
120
click to vote
KBSE
2007
IEEE
15 years 8 months ago
2007
IEEE
Effective bug localization is important for realizing automated debugging. One attractive approach is to apply statistical techniques on a collection of evaluation profiles of pr...
130
click to vote
ICC
2007
IEEE
15 years 5 months ago
2007
IEEE
This paper reports on a promising approach for solving problems found when Multi Protocol Label Switching (MPLS), soon to be a dominant protocol, is used in core network systems. D...
107
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
111
Voted
FOCS
1999
IEEE
15 years 6 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...