Results 91 to 100 of about 306 (178)
On the parameterized complexity of computing tree-partitions [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe study the parameterized complexity of computing the tree-partition-width, a graph parameter equivalent to treewidth on graphs of bounded maximum degree.
Hans L. Bodlaender +2 more
doaj +1 more source
Deciding Clique-Width for Graphs of Bounded Tree-Width
Journal of Graph Algorithms and Applications, 2003 We show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width k for some fixed integer k.
Wolfgang Espelage +2 more
doaj +1 more source
Approximating the Treewidth of AT-Free Graphs
Discrete Applied Mathematics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bouchitté, Vincent, Todinca, Ioan
openaire +3 more sources
On the Complexity of Embedding in Graph Products
Computing in Geometry and TopologyGraph embedding, especially as a subgraph of a grid, is an old topic in VLSI design and graph drawing. In this paper, we investigate related questions concerning the complexity of embedding a graph G in a host graph that is the strong product of a path ...
Therese Biedl +2 more
doaj +1 more source
The treewidth and pathwidth of hypercubes
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
L. Sunil Chandran, Telikepalli Kavitha
openaire +1 more source
The algorithmic theory of treewidth
Electronic Notes in Discrete Mathematics, 2000 Abstract Treewidth is a graph measure with several applications. In this abstract, it is discussed that many otherwise intractable problems become polynomial or linear time solvable when restricted to graphs of bounded treewidth, and some other algorithmic results that use treewidth (e.g., applied to planar graphs) are discussed.
openaire +1 more source
The Treewidth of Java Programs
, 2002 Intuitively, the treewidth of a graph $G$ measures how close $G$ is to being a tree. The lower the treewidth, the faster we can solve various optimization problems on $G$, by dynamic programming along the tree structure. In the paper M.Thorup, All Structured |Programs have Small Tree-Width and Good Register Allocation [8] it is shown that the control ...
Gustedt, Jens +2 more
openaire +3 more sources
Automated design of dynamic programming schemes for RNA folding with pseudoknots. [PDF]
Algorithms Mol Biol, 2023 Marchand B +4 more
europepmc +1 more source
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. [PDF]
Algorithmica, 2022 Golovach PA, Zehavi M.
europepmc +1 more source
Attractor detection and enumeration algorithms for Boolean networks. [PDF]
Comput Struct Biotechnol J, 2022 Mori T, Akutsu T.
europepmc +1 more source