Searching for authors named "Thomas Wolle" – sorted by Relevance.
9 documents found, showing 1 through 9.
-
A Framework for Network Reliability Problems on Graphs of Bounded Treewidth
- …In this paper, we consider problems related to the network reliability problem restricted to graphs of bounded treewidth. We consider undirected simple graphs with a rational number in [0, 1] associated to each vertex and edge. These graphs model networks in which sites and links can fail with a …
- Cited by 4 (2 self) – Add To MetaCart
-
A Note on the Complexity of Network Reliability Problems
- …Let be given an undirected, simple graph G = (V, E). We associate to each vertex a number in [0, 1] - its reliability, i.e. the probability that it does not fail. Furthermore, let a set S V of clients be given. Vertex failures are independent of each other.…
- Cited by 2 (0 self) – Add To MetaCart
-
Finding popular places
- …Abstract. Widespread availability of location aware devices (such as GPS receivers) promotes capture of detailed movement trajectories of people, animals, vehicles and other moving objects, opening new options for a better understanding of the processes involved. We investigate spatio-temporal movem…
- Cited by 1 (1 self) – Add To MetaCart
-
Reporting flock patterns
- …Abstract. Data representing moving objects is rapidly getting more available, especially in the area of wildlife GPS tracking. It is a central belief that information is hidden in large data sets in the form of interesting patterns. One of the most common spatio-temporal patterns sought after is flo…
- Cited by 6 (3 self) – Add To MetaCart
-
Contraction Degeneracy on Cographs
- …The contraction degeneracy of a graph G is the maximum minimum degree of G # over all minors G # of G. The corresponding decision problem is known to be NP -complete.…
- Cited by 3 (3 self) – Add To MetaCart
-
Thomas Wolle and Hans L. Bodlaender
- …Contracting an edge is the operation that introduces a new vertex that is adjacent to all vertices the endpoints of the contracted edge are adjacent to, and then deletes the endpoints of this edge and all their incident edges. In this note, we give a formal approach to the notion of edge contract…
- Add To MetaCart
-
Contraction and Treewidth Lower Bounds
- …Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all subgraphs of the minimum degree. The degeneracy is polynomial time computable. We introduce the notion of contraction …
- Cited by 16 (13 self) – Add To MetaCart
-
Arie M. C. A. Koster
- …Every lower bound for treewidth can be extended by taking the maximum of the lower bound over all subgraphs or minors. This extension is shown to be a very vital idea for improving treewidth lower bounds. In this paper, we investigate a total of nine graph parameters, providing lower bounds for t…
- Add To MetaCart
-
Thomas Wolle
- …The parameter contraction degeneracy --- the maximum minimum degree over all minors of a graph --- is a treewidth lower bound and was first defined in [3]. In experiments it was shown that this lower bound improves upon other treewidth lower bounds [3]. In this note, we examine some relationships…
- Add To MetaCart
Showing 1 through 9.
