Bounded treewidth
Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth
... of bounded treewidth, exploiting the simple structure of graphs that do not contain P 3 or P 4 as a minor (or as a subgraph, which in the case of paths is ...
13
Steepest ascent can be exponential in bounded treewidth problems
... Bounded treewidth Fitness landscape a b s t r a c t We investigate the complexity of local search based on steepest ...has bounded treewidth (in our construction, treewidth 7), there ...
10
Steepest ascent can be exponential in bounded treewidth problems
... Bounded treewidth Fitness landscape a b s t r a c t We investigate the complexity of local search based on steepest ...has bounded treewidth (in our construction, treewidth 7), there ...
9
On the Number of Labeled Graphs of Bounded Treewidth
... 1. L. W. Beineke and R. E. Pippert. The number of labeled k-dimensional trees. Journal of Combinatorial Theory, 6(2):200–205, 1969. 2. M. Bodirsky, O. Gim´ enez, M. Kang, and M. Noy. Enumeration and limit laws for ...
14
The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries
... and bounded treewidth conjunctive queries ...with bounded-depth ontologies have nonrecursive datalog (NDL) rewritings that can be constructed and evaluated in LOGCFL for combined complexity, even in ...
49
Java Programs do not have Bounded Treewidth
... have Bounded Treewidth 3 1 Background Most structured language constructs such as while-loops, for-loops and if-then-else allow programs to be recur- sively decomposed into basic blocks with a single entry ...
10
Weighted proper orientations of trees and graphs of bounded treewidth
... Minimum Maximum Indegree Input: An edge-weighted graph (G, w) and a positive integer k. Output: Is there an orientation D of G such that µ − (D) ≤ k? The above problem has been recently studied in the literature [ 7 , 18 ...
15
Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs
... is treewidth, which –informally speaking– quantifies the topological resemblance of a graph to a ...of treewidth at most ...the treewidth of G, denoted by t, and the objective is to find the smallest ...
16
Treewidth: algorithmic, combinatorial, and practical aspects
... It appears that treewidth has a huge number of algorithmic applications. The key point is the fact that many problems that are NP-hard on general graphs can be solved in polynomial time on trees. This is the case, ...
219
An Experimental Study of the Treewidth of Real-World Graph Data
... which treewidth decomposition can be used starts from a simple observation made in studies on complex graphs, that is, that they tend to exhibit a tree-like fringe and a densely connected core [52, ...to ...
19
k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth
... the treewidth of a graph is the smallest width over its ...with bounded treewidth ...with bounded treewidth ...their treewidth is expected to be large ...
13
On treewidth and related parameters of random geometric graphs *
... Since random geometric graphs have been heavily used for modeling communication net- works, it is natural to analyze the expected complexity of different algorithms applied to this class. Courcelle’s Theorem [4] states ...
24
On the treewidth and related parameters of random geometric graphs
... Since random geometric graphs have been heavily used for modeling communication net- works, it is natural to analyze the expected complexity of different algorithms applied to this class. Courcelle’s Theorem [4] states ...
22
k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth
... the treewidth of a graph is the smallest width over its ...of bounded treewidth ...with bounded treewidth [12, ...their treewidth is expected to be large ...
14
$k$-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth
... the treewidth of a graph is the smallest width of its ...with bounded treewidth ...with bounded treewidth ...their treewidth is expected to be large ...
5
To Approximate Treewidth, Use Treelength!
... to bounded-treelength graphs that are more common than bounded-treewidth graphs amongst the complex networks, but for which there seem to be less algorithmic ...large treewidth, while it is ...
14
k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth
... the treewidth of a graph is the smallest width over its tree- ...with bounded treewidth ...with bounded treewidth [Bod93, ...their treewidth is expected to be large ...
18
The role of planarity in connectivity problems parameterized by treewidth
... a graph parameter call treewidth that is a way to measure the distance between a given graph and a tree. This parameter becames very interesting with the apparition of the Courcelle’s theorem in [3]. This theorem ...
36
The Treewidth of Java Programs
... Obviously the introduction of labels make things more complicated in that regard, since each label intro- duces an extra jump target for both break and continue statements. In Section 2 we will prove technically that by ...
15
Bounded verification of voting software
... as bounded ver- ification, examines all executions of a procedure up to some finite bound on the size of the heap and number of loop unrollings and reports counterexamples as actual procedure ...
16