Results 131 to 140 of about 4,776 (247)
Treewidth and Minimum Fill-in on d-Trapezoid Graphs [PDF]
, 2002 Hans L. Bodlaender +3 more
openalex +1 more source
On the Maximum Cardinality Search Lower Bound for Treewidth [PDF]
, 2004 Hans L. Bodlaender, Arie M. C. A. Koster
openalex +1 more source
Heuristic and metaheuristic methods for computing graph treewidth [PDF]
, 2004 François Clautiaux +3 more
openalex +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
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. [PDF]
Algorithmica, 2022 Golovach PA, Zehavi M.
europepmc +1 more source
Degree-constrained decompositions of graphs: Bounded treewidth and planarity [PDF]
, 2006 Cristina Bazgan +2 more
openalex +1 more source
On Digraph Coloring Problems and Treewidth Duality [PDF]
, 2006 Albert Atserias
openalex +1 more source
Treewidth-aware reductions of normal ASP to SAT - Is normal ASP harder than SAT after all? [PDF]
Artificial Intelligence, 2021 Markus Hecher
semanticscholar +1 more source
Non-Preemptive Tree Packing. [PDF]
Algorithmica, 2023 Lendl S, Woeginger G, Wulf L.
europepmc +1 more source
Contraction and Treewidth Lower Bounds [PDF]
, 2006 Hans L. Bodlaender +2 more
openalex +1 more source