A linear-time algorithm to find four independent spanning trees in four-connected planar graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1517, Issue , 1998, Pages 310-323

  Miura, Kazuyuki ^a   Takahashi, Daishiro ^a   Nakano, Shin Ichi ^a   Nishizeki, Takao ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; GRAPHIC METHODS;

4-CONNECTED; FOUR-CONNECTED PLANAR GRAPHS; GRAPH G; K-TREES; LINEAR-TIME ALGORITHMS; NATURAL NUMBER; PLANAR GRAPH; SPANNING TREE;

TREES (MATHEMATICS);

EID: 22444454497     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10692760_25     Document Type: Conference Paper

References (13)

1. F. Bao and Y. Igarashi, Reliable broadcasting in product networks with By-zantime faults, Proc. 26th Annual International Symposium on Fault-Tolelant Computing (FTCS'96) (1996) 262-271.
2. G. Di Battista, R. Tamassia and L Vismara, Output-sensitive reporting of disjoint paths, Technical Report CS-96-25, Department of Computer Science, Brown University (1996).
3. M. Chrobak and G. Kant, Convex grid drawings of 3-connected planar graphs, Technical Report RUU-CS-93-45, Department of Computer Science, Utrecht University (1993).
4. J. Cheriyan and S. N. Maheshwari, Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs, J. Algorithms, 9 (1988) 507-537.
5. D. Dolev, J. Y. Halpern, B. Simons, and R. Strong, A new look at fault tolerant network routing, Proc. 16th Annual ACM Symposium on Theory of Computing (1984) 526-535.
6. S. Even, Graph Algorithms, Computer Science Press, Potomac (1979).
7. A. Huck, Independent trees in Graphs, Graphs and Combinatorics, 10 (1994) 29-45.
8. A. Itai and M. Rodeh, The multi-tree approach to reliability in distributed networks, Information and Computation, 79 (1988) 43-59.
9. G. Kant and X. He, Two algorithms for finding rectangular duals of planar-graphs, Proc. 19th Workshop on Graph-Theoretic Concepts in Computer Science (WG'93), LNCS 790 (1994) 396-410.
10. S. Khuller and B. Schieber, On independent spanning trees, Information Processing Letters, 42 (1992) 321-323.
11. S. Nakano, M. S. Rahman and T. Nishizeki, A linear time algorithm for four-partitioning four-connected planar graphs, Information Processing Letters,62 (1997) 315-322.
12. K. Obokata, Y. Iwasaki, F. Bao and Y. Igarashi, Independent spanning trees of product graphs and their construction, Proc. 22nd Workshop on Graph-Theoretic Concepts in Computer Science (WG'96), LNCS 1197 (1996) 338-351.
13. A. Zehavi and A. Itai, Three tree-paths, J. Graph Theory, 13 (1989) 175-188.