Results 91 to 100 of about 609 (128)
Counting independent sets in graphs with bounded bipartite pathwidth
, 2018 Martin J.S. Dyer +2 more
openalex +2 more sources
Counting Linear Extensions: Parameterizations by Treewidth. [PDF]
Algorithmica, 2019 Eiben E, Ganian R, Kangas K, Ordyniak S.
europepmc +1 more source
Maximum-scoring path sets on pangenome graphs of constant treewidth. [PDF]
Front BioinformBrejová B +3 more
europepmc +1 more source
Clustered colouring of graph classes with bounded treedepth or pathwidth
, 2022 Sergey Norin, Alex Scott, David R. Wood
openalex +2 more sources
Smart Accessibility: Design Process of Integrated Geospatial Data Models to Present User-Customized Universal Design Information. [PDF]
Front Psychol, 2019 Han SR, Yoon S, Cho S.
europepmc +1 more source
Exponential Steepest Ascent from Valued Constraint Graphs of Pathwidth Four [PDF]
Artem Kaznatcheev, Melle van Marle
openalex +1 more source
Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2 [PDF]
, 2019 Petr A. Golovach +4 more
openalex +1 more source
Finding Cactus Roots in Polynomial Time. [PDF]
Theory Comput Syst, 2018 Golovach PA +3 more
europepmc +1 more source
Graph Homomorphism, Monotone Classes and Bounded Pathwidth [PDF]
Tala Eagling-Vose +4 more
openalex +1 more source