Results 111 to 120 of about 1,532 (205)
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. [PDF]
Algorithmica, 2022 Golovach PA, Zehavi M.
europepmc +1 more source
Non-Preemptive Tree Packing. [PDF]
Algorithmica, 2023 Lendl S, Woeginger G, Wulf L.
europepmc +1 more source
A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs
, 2022 Alina Ene +3 more
openalex +2 more sources
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results [PDF]
, 2022 Jacob Focke +6 more
openalex +1 more source
Extended Formulation for CSP that is Compact for Instances of Bounded\n Treewidth [PDF]
, 2015 Petr Kolman, Martin Koutecký
openalex +1 more source
Treewidth versus clique number. II. Tree-independence number [PDF]
, 2021 Clément Dallard +2 more
openalex +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
Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure [PDF]
, 2021 Clément Dallard +2 more
openalex +1 more source
A witness drawing of a graph is a visualization that clearly shows a given property of a graph. We study and implement various drawing paradigms for witness drawings to clearly show that graphs have bounded pathwidth or treewidth. Our approach draws the tree decomposition or path decomposition as a tree of bags, with induced subgraphs shown in each bag,
Chiu, Alvin +4 more
openaire +3 more sources