4201 search results - page 229 / 841 » Interaction graphs: Additives |
150
click to vote
WG
1998
Springer
15 years 10 months ago
1998
Springer
We study the integral uniform (multicommodity) flow problem in a graph G and construct a fractional solution whose properties are invariant under the action of a group of automorp...
175
click to vote
MFCS
1997
Springer
15 years 10 months ago
1997
Springer
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
200
click to vote
ESA
1994
Springer
15 years 10 months ago
1994
Springer
We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact description, is easy to implemen...
117
click to vote
PLDI
1994
ACM
15 years 10 months ago
1994
ACM
Programslices have potentialuses in manysoftware engineering applications. Traditional slicing algorithms, however, do not work correctly on programs that contain explicit jump st...
136
click to vote
GD
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. The typical use of force-directed layout is to create organiclooking, straight-edge drawings of large graphs while combinatorial techniques are generally preferred for hi...