Results 121 to 130 of about 5,860 (222)
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
On the Maximum Cardinality Search Lower Bound for Treewidth [PDF]
, 2004 Hans L. Bodlaender, Arie M. C. A. Koster
openalex +1 more source
Non-Preemptive Tree Packing. [PDF]
Algorithmica, 2023 Lendl S, Woeginger G, Wulf L.
europepmc +1 more source
Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020. [PDF]
Algorithmica, 2022 Gąsieniec L, Klasing R, Radzik T.
europepmc +1 more source
On Digraph Coloring Problems and Treewidth Duality [PDF]
, 2006 Albert Atserias
openalex +1 more source
Contraction and Treewidth Lower Bounds [PDF]
, 2006 Hans L. Bodlaender +2 more
openalex +1 more source
Degree-constrained decompositions of graphs: Bounded treewidth and planarity [PDF]
, 2006 Cristina Bazgan +2 more
openalex +1 more source
Graph Treewidth and Geometric Thickness Parameters [PDF]
, 2006 Vida Dujmović, David R. Wood
openalex +1 more source
Faster algorithms for counting subgraphs in sparse graphs. [PDF]
Algorithmica, 2021 Bressan M.
europepmc +1 more source