Willy-B. Strothmann  Home/Search
Context Related
| unipaderborn.de/c...SSstrothmann.ps.gz Cached: PS.gz PS PDF DjVu Image Update Help From: unipaderborn.de/fachbereich/A... (more) Homepages: W.Strothmann HPSearch (Update Links) |
Rate this article:      (best)Comment on this article |
Abstract: This document has been typeset with L T E X. Beneath the usage of the undocumented commands "frontmatter and "mainmatter I used the following styles: ffl a4.sty for the german paper size (Update)
Context of citations to this paper: More
.... finding efficiently a Delta spanning tree in a biconnected planar graph with a maximum degree 2 Delta Gamma 2 do to Czumaj and Strothmann [2]. Key Words: dynamic algorithms, graph algorithms, graph connectivity, planar graphs. 1 Introduction In many graph algorithms the graph...
.... previously reported in [LS97] Chapter 4 Chapter 9 excluding Chapter 6 is joint work with Artur Czumaj and has been presented at ESA 97 [CS97] Sponsors My research has been partially supported by ffl ESPRIT Basic Research Action ALCOM II ffl EU ESPRIT Long Term Project...
Cited by: More
Bounded Degree Spanning Trees - Strothmann (Correct)
Decremental Biconnectivity on Planar Graphs - Lukovszki, Strothman (1997) (Correct)
Active bibliography (related documents): More All
3.1: Bounded Degree Spanning Trees (Extended abstract) - Czumaj, Strothmann (Correct)
0.9: Long cycles in graphs on a fixed surface - Böhme, Mohar, al. (1999) (Correct)
0.8: On 3-Connected Plane Graphs Without Triangular Faces - Harant, Jendrol, Tkac (1998) (Correct)
Similar documents based on text: More All
0.5: New Results on Geometric Spanners and Their Applications - Lukovszki (1999) (Correct)
0.4: Parallel Algorithmic Techniques: PRAM Algorithms And PRAM.. - Czumaj (1995) (Correct)
0.3: Learning with Recurrent Neural Networks - Hammer (1999) (Correct)
Related documents from co-citation: More All
3: Dynamic Graph Algorithms and Data Structures (context) - Poutr'e - 1991
2: Fully Dynamic Biconnectivity and Transitive Closure (context) - Henzinger, King - 1995
2: Decremental 2- and 3-Connectivity on Planar Graphs (context) - Giammarresi, Italiano - 1996
BibTeX entry: (Update)
A. Czumaj and W.-B. Strothmann. Bounded Degree Spanning Trees. To appear in ESA 97. http://citeseer.nj.nec.com/511457.html More
@misc{ czumaj-bounded,
author = "A. Czumaj and W. Strothmann",
title = "Bounded Degree Spanning Trees",
text = "A. Czumaj and W.-B. Strothmann. Bounded Degree Spanning Trees. To appear
in ESA 97.",
url = "citeseer.nj.nec.com/511457.html" }
Citations (may not include all citations):3392 Computers and Intractability: A Guide to the Theory of NP-co.. (context) - Garey, Johnson - 1979
219 Primitives for the manipulation of general subdivisions and .. (context) - Guibas, Stolfi - 1985
134 The NP-completeness column: An ongoing guide (context) - Johnson - 1985
129 Society for Industrial and Applied Mathematics (context) - Tarjan, Network et al. - 1983
115 A general approximation technique for constrained forest pro.. - Goemans, Williamson - 1996
112 Efficient planarity testing (context) - Hopcroft, Tarjan - 1974
52 Extremal Graph Theory (context) - Bollobas - 1978
50 A linear-time algorithm for finding a sparse k-connected spa.. (context) - Nagamochi, Ibaraki - 1992
39 Maintaining bridge-connected and biconnected components on-l.. (context) - Westbrook, Tarjan - 1992
38 EATCS Monographs on Theoretical Computer Science (context) - Schmidt, Strohlein et al. - 1993
31 Improved data structures for fully dynamic biconnectivity (context) - Rauch - 1994
26 Canadian Journal of Mathematics (context) - Edmonds, trees - 1965
23 Improved approximation algorithms for uniform connectivity p.. - Khuller, Raghavachari - 1995
22 The planar Hamiltonian circuit problem is NP-complete (context) - Garey, Johnson et al. - 1976
22 Fully dynamic biconnectivity and transitive closure (context) - Henzinger, King - 1995
19 Low degree spanning trees of small weight - Khuller, Raghavachari et al. - 1996
18 Approximating the minimum degree spanning tree to within one.. (context) - Furer, Raghavachari - 1992
18 Approximation algorithms for finding highly connected subgra.. - Khuller - 1997
18 Edge-deletion problems (context) - Yannakakis - 1981
16 Approximating minimum-size k-connected spanning subgraphs vi.. - Cheriyan, Thurimella - 1996
16 Approximating minimum-size k-connected spanning subgraphs vi.. - Cheriyan, Thurimella - 1996
15 Tough graphs and Hamiltonian circuits (context) - Chvatal - 1973
14 Dynamic Graph Algorithms and Data Structures (context) - Poutre - 1991
14 Dynamic graph algorithms and data structures (context) - Poutre - 1991
12 Transactions of the American Mathematical Society (context) - Tutte, on et al. - 1956
12 Recognizing tough graphs is NP-hard (context) - Bauer, Hakimi et al. - 1990
11 Approximating the minimum-degree Steiner tree to within one .. (context) - Furer, Raghavachari - 1994
9 The complexity of restricted spanning tree problems (context) - Papadimitriou, Yannakakis - 1982
9 Die Theorie der regularen Graphen (context) - Petersen
9 Certificates and fast algorithms for biconnectivity in fully.. - Henzinger, Poutre - 1995
9 of Computer Algorithms. Computer Science and Information Pro.. (context) - Aho, Hopcroft et al. - 1973
8 Computing the orientable genus of projective graphs (context) - Fiedler, Huneke et al. - 1995
8 connected projective-planar graphs are Hamiltonian (context) - Thomas, Yu - 1994
8 The Hamiltonian cycle problem is linear-time solvable for 4-.. (context) - Chiba, Nishizeki - 1989
7 Trees in polyhedral graphs (context) - Barnette - 1966
7 Dynamic hashing in real time (context) - Dietzfelbinger, auf - 1992
6 volume 21 of Encyclopedia of Mathematics and its Application.. (context) - Tutte - 1984
6 NP-completeness and degree restricted spanning trees (context) - Douglas - 1992
5 WileyInterscience Series in Discrete Mathematics and Optimiz.. (context) - Gross, Tucker et al. - 1987
5 North-Holland Publishing Company (context) - White, Groups et al. - 1973
5 a connection between the existence of k-trees and the toughn.. (context) - Win - 1989
4 Algorithms for finding low degree structures (context) - Raghavachari - 1997
4 connected nonHamiltonian non-nedge -colorable graphs (context) - Meredith, n- - 1973
4 Projective planarity in linear time (context) - Mohar - 1993
4 Dynamic graph algorithms - Eppstein, Galil et al. - 1997
4 Decremental 2- and 3-connectivity on planar graphs (context) - Giammarresi, Italiano - 1996
4 Separator based sparsification I: Planarity testing and mini.. (context) - Eppstein, Galil et al. - 1996
3 connected coverings of bounded degree in 3-connected graphs (context) - Gao - 1995
3 connected toroidal graphs are Hamiltonian (context) - Thomas, Yu - 1997
3 Computer Software Engineering Series (context) - Even - 1979
3 connected spanning subgraphs of planar 3-connected graphs (context) - Barnette - 1994
3 Topological graph theory: A survey - Archdeacon - 1996
3 A new planarity test - Shih, Hsu - 1996
3 connected spanning subgraphs with low maximum degree (context) - Sanders, Zhao - 1996
2 Embeddings of graphs with no short noncontractable cycles (context) - Thomassen - 1990
2 volume 209 of Die Grundlagen der mathematischen Wissenschaft.. (context) - Ringel, Theorem - 1974
2 the complexity of finding multi-constrained spanning trees (context) - Camerini, Galbiati et al. - 1983
2 Decremental biconnectivity on planar graphs (context) - Lukovszki, Strothmann - 1997
2 Preliminary Version has been presented at ICALP (context) - Tamassia, graph et al. - 1996
2 Bulletin of Australian Mathematics Society (context) - Jackson, Parsons et al. - 1981
2 Bounded degree spanning trees - Czumaj, Strothmann - 1997
2 the largest tree of a given maximum degree in a connected gr.. (context) - Caro, Krasikov et al. - 1989
2 Complexity of spanning tree problems (context) - Camerini, Galgiati et al. - 1980
1 trees in polyhedral maps (context) - Barnette - 1992
1 Hamiltonicity in some special classes of graphs (context) - Lesniak - 1996
1 Austalasian Journal on Combinatorics (context) - Jackson, Wormald et al. - 1990
1 Spanning trees with bounded degrees (context) - Neumann-Lara, Rivera-Campo - 1991
1 Unexplored and semi-explored territories in graph theory (context) - St, Nash-Williams - 1973
1 A linear disjoint path algorithm (context) - Ebert - 1982
1 Spanning planar subgraphs in the torus and Klein bottle (context) - Brunet, Ellingham et al. - 1995
1 private communication (context) - Henzinger - 1997
1 Connected spanning subgraphs of 3connected planar graphs (context) - Enomoto, Iida et al. - 1996
1 trees and walks for graphs on surfaces (context) - Ellingham, cycles - 1996
1 unabridged and corrected republication of the work first pub.. (context) - Henle, Introduction et al. - 1979
1 Berlin \Delta Heidelberg \Delta New York \Delta London \Delt.. (context) - Bredon, Geometry et al. - 1993
1 Forbidden subgraphs and hamiltonian properties; a survey (context) - Faudree - 1996
1 A preliminary version appeared at STOC (context) - Khuller, Vishkin et al. - 1994
1 Output-sensitive reporting of disjoint paths - Di Battista, Tamassia et al. - 1996
1 walks in circuit graphs (context) - Gao, Richter - 1994
1 Bulletin of the American Mathematical Society (context) - Grunbaum, graphs - 1970
Documents on the same site (http://www.uni-paderborn.de/fachbereich/AG/agmadh/WWW/DFG-SPP/): More
Decremental Biconnectivity on Planar Graphs - Lukovszki, Strothman (1997) (Correct)
Bounded Degree Spanning Trees (Extended abstract) - Czumaj, Strothmann (Correct)
New Results on Fault Tolerant Geometric Spanners - Lukovszki (1999) (Correct)
Online articles have much greater impact More about CiteSeer Add search form to your site Submit documents Feedback
CiteSeer - citeseer.org - Terms of Service - Privacy Policy - Copyright © 1997-2002 NEC Research Institute