A. Czumaj and W.B. Strothmann, Bounded degree spanning trees. In Algorithms{ESA 97 (Graz), Springer Lecture Notes in Computer Science 1284 (1997) pages 104-117. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Bounded Degree Spanning Trees - Strothmann (1 citation) Self-citation (Strothmann) (Correct)
....a better algorithm. Connectivity means vertex connectivity, unless stated otherwise. iii iv Joint Work Chapter 3 is joint work with Tamas Lukovszki and 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 20244 (ALCOM IT) ffl DFG Leibniz Grant Me872 6 1 ffl DFG Research Cluster Me872 7 1: Efficient Algorithms for Discrete Problems and Their Applications ....
A. Czumaj and W.-B. Strothmann. Bounded degree spanning trees. In R. Burkhard and G. Woeginger, editors, Fifth Annual European Symposium on Algorithms (ESA`97), volume 1284 of Lecture Notes in Computer Science, Berlin \Delta Heidelberg \Delta New York \Delta London \Delta Paris, 1997. Springer.
Decremental Biconnectivity on Planar Graphs - Lukovszki, Strothman (1997) Self-citation (Strothmann) (Correct)
....O(n) space. Finally we describe some simply additional operations on the decremental data structure. By aid of them this the data structure is applicable for 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 is subject of changes, i.e: edge vertex insertion deletion. Due to this the adjacencies and the structure changes. Nevertheless in some applications there are ....
....additional operations splitting a vertex and contracting over an edge. By the aid of this operations one can construct in the same time and space bounds as in Theorem 1. 1 a spanning tree T of a biconnected planar graph G, where the degree of a vertex in T is roughly half of its degree in G [2]. The paper has five further sections. In Section 2 we describe preliminary definitions, followed by a section on planar subdivisions. In Section 4 we describe our data structures. In Section 5 we present the algorithm for the decremental biconnectivity problem together with an analysis. In the ....
[Article contains additional citation context not shown here]
A. Czumaj and W.-B. Strothmann. Bounded Degree Spanning Trees. To appear in ESA 97.
Small Degree Out-Branchings - Rgen Bang-Jensen St (Correct)
No context found.
A. Czumaj and W.B. Strothmann, Bounded degree spanning trees. In Algorithms{ESA 97 (Graz), Springer Lecture Notes in Computer Science 1284 (1997) pages 104-117.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC