The multi-tree approach to reliability in distributed networks
Information and Computation
Information Processing Letters
A linear-time algorithm for four-partitioning four-connected planar graphs
Information Processing Letters
Embedding planar graphs on the grid
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Graph Algorithms
Two Algorithms for Finding Rectangular Duals of Planar Graphs
WG '93 Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science
Independent Spanning Trees of Product Graphs
WG '96 Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science
A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
Reliable broadcasting in product networks with Byzantine faults
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
A new look at fault tolerant network routing
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Output-Sensitive Reporting of Disjoint Paths
Output-Sensitive Reporting of Disjoint Paths
Completely Independent Spanning Trees in Maximal Planar Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Optimal Independent Spanning Trees on Odd Graphs
The Journal of Supercomputing
| Hi-index | 0.00 |
Given a graph G, a designated vertex r and a natural number k, we wish to find k "independent" spanning trees of G rooted at r, that is, k spanning trees such that, for any vertex v, the k paths connecting r and v in the k trees are internally disjoint in G. In this paper we give a linear-time algorithm to find k independent spanning trees in a k-connected maximal planar graph rooted at any designated vertex.