10 search results - page 1 / 2 » A Linear Time Algorithm for the Arc Disjoint Menger Problem ... |
ALGORITHMICA
2000
13 years 4 months ago
2000
ESA
2009
Springer
13 years 11 months ago
2009
Springer
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
CORR
2008
Springer
13 years 5 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...
ESA
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
WG
2001
Springer
13 years 9 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...