134
Voted
GD
2006
Springer
15 years 11 months ago
2006
Springer
149
Voted
GD
2006
Springer
15 years 11 months ago
2006
Springer
223
click to vote
GD
2006
Springer
15 years 11 months ago
2006
Springer
st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the pas...
162
click to vote
GD
2006
Springer
15 years 11 months ago
2006
Springer
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...