Results 131 to 140 of about 11,104 (228)
Graph Isomorphism in Quasipolynomial Time Parameterized by Treewidth
, 2020 Daniel Wiebking
openalex +2 more sources
The $k$-path coloring problem in graphs with bounded treewidth: an\n application in integrated circuit manufacturing [PDF]
, 2019 Dehia Ait-Ferhat +3 more
openalex +1 more source
Heuristic computation of exact treewidth
, 2022 We are interested in computing the treewidth $\tw(G)$ of a given graph $G$. Our approach is to design heuristic algorithms for computing a sequence of improving upper bounds and a sequence of improving lower bounds, which would hopefully converge to $\tw(G)$ from both sides.
openaire +4 more sources
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. [PDF]
Algorithmica, 2022 Golovach PA, Zehavi M.
europepmc +1 more source
, 1993 This thesis focuses on problems related to treewidth and pathwidth of graphs. Many problems are difficult to solve for graphs in general. The treewidth of a graph is a good indication whether one can obtain a solution within reasonable time. A necessary ingredient is a treedecomposition of the graph with small width.
openaire +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
Approximation algorithms for network design and cut problems in bounded-treewidth
, 2020 Daniel Vaz
openalex +1 more source
Approximation metatheorem for fractionally treewidth-fragile graphs. [PDF]
, 2021 Zdenĕk Dvořák
openalex
Non-Preemptive Tree Packing. [PDF]
Algorithmica, 2023 Lendl S, Woeginger G, Wulf L.
europepmc +1 more source
Treewidth versus clique number. II. Tree-independence number
, 2023 Clément Dallard +2 more
openalex +1 more source