Drawings and Independent Spanning Trees

Drawings and Independent Spanning Trees (2001)

Cached

Download Links

[www.nishizeki.ecei.tohoku.ac.jp]

by Kazuyuki Miura

BibTeX

@MISC{Miura01drawingsand,
    author = {Kazuyuki Miura},
    title = {Drawings and Independent Spanning Trees},
    year = {2001}
}

Bookmark

OpenURL

Abstract

Citations

406	Testing for the consecutive ones properties, interval graphs and graph planarity using PQ-tree algorithm - Booth, Lueker - 1976
312	Graph Algorithms - Even - 1979
168	Embedding planar graphs on the grid - Schnyder - 1990
129	How to draw a planar graph on a grid - Fraysseix, Pach, et al. - 1990
102	A linear algorithm for embedding planar graphs using PQ-trees - Chiba, Nishizeki, et al. - 1985
85	Bemekungen zum Vierfarbenproblem - Wagner - 1936
72	Planar Graphs: Theory and Algorithms - Nishizeki, Chiba - 1988
54	Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems - Kant, He - 1997
49	Drawing planar graphs using the canonical ordering - Kant - 1996
49	Convex maps - Stein - 1951
48	The multi-tree approach to reliability in distributed networks - Itai, Rodeh - 1988
34	Convex grid drawings of 3-connected planar graphs - Chrobak, Kant - 1997
34	Linear algorithms for convex drawings of planar graphs - Chiba, Yamanouchi, et al. - 1984
33	A linear-time algorithm for drawing a planar graph on a grid - Chrobak, Payne - 1995
29	Minimum-width grid drawings of plane graphs - Chrobak, Nakano - 1998
25	Finding non-separating induced cycle and independent spanning trees in 3-connected graphs - Cheriyan, Maheshwari - 1988
22	A new look at fault tolerant network routing - Dolev, Halpern, et al. - 1984
21	Drawing planar graphs nicely - Chiba, Onoguchi, et al. - 1985
21	Three tree-paths - Zehavi, Itai - 1989
14	How to draw a graph, Proc - Tutte - 1963
12	Independent trees in graphs - Huck - 1994
12	Grid embedding of 4-connected plane graphs - He - 1996
11	Grid drawings of four-connected plane graphs - Miura, Nakano, et al.
10	Output-sensitive reporting of disjoint paths - Battista, Tamassia, et al. - 1999
10	Convex drawings of planar graphs - Schnyder, Trotter - 1992
7	On Independent Spanning Trees - Khuller, Schieber - 1992
5	Reliable broadcasting in product networks with Byzantime faults - Bao, Igarashi - 1996
5	E cient planarity testing - Hopcroft, Tarjan - 1974
5	A fast linear time embedding algorithm based on the Hofcroft-Tarjan planarity test - Mutzel - 1992
4	On straight lines representation of plane graphs - Fary - 1948
3	Tarjan, New solutions to four planar graph problems - Cai, Han, et al. - 1989
3	Independent trees in planar graphs - Huck - 1999
3	Two algorithms for nding rectangular duals of planar graphs - Kant, He - 1993
3	Convex grid drawings of four-connected plane graphs, Technical Report of IPSJ, 2000-AL-74 - Miura, Nakano, et al. - 2000
2	Independent spanning trees of product graphs and their construction - Obokata, Iwasaki, et al. - 1996
1	Tamassia and I.G. Tollis, Automatic graph drawing: an annotated bibliography - Battista, Eadesx, et al. - 1994
1	Surleprobleme des courbes gauches en topologie - Kuratowaski - 1930
1	Shin-ichi Nakano and Takao Nishizeki, Grid drawings of fourconnected plane graphs - Miura - 1999
1	A linear time algorithm to nd four independent spanning trees in four-connected planar graphs - Miura, Takahashi, et al. - 1999
1	A linear-time algorithm to nd independent spanning trees in maximal planar graphs, sf - Nagai, Nakano - 1928
1	A linear time algorithm for four partitioning four-connected planar graphs - Nakano, Rahman, et al. - 1997
1	Tutte, Convex representations of graphs, sf Proc - T - 1960
1	Nakano and Takao Nishizeki, A linear-time algorithm to nd four independent spanning trees - Miura, Takahashi, et al. - 1999
1	Nakano and Takao Nishizeki, Convex grid drawings of four-connected plane graphs - Miura, Shin-ichi - 1997