GD
2006
Springer
13 years 9 months ago
2006
Springer
GD
2006
Springer
13 years 9 months ago
2006
Springer
GD
2006
Springer
13 years 9 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...
GD
2006
Springer
13 years 9 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...