Results 131 to 140 of about 3,161 (171)
Improved approximation for 3-dimensional matching via bounded pathwidth local search
Marek Cygan
openalex +2 more sources
On exploring always-connected temporal graphs of small pathwidth
H. Bodlaender, Tom C. van der Zanden
semanticscholar +1 more source
Bounding the number of $(σ,ρ)$-dominating sets in trees, forests and graphs of bounded pathwidth
Matthieu Rosenfeld
openalex +2 more sources
On the treewidth and pathwidth of permutation graphs
Kloks, A.J.J., Bodlaender, H.L.
openaire +2 more sources
Lower bounds on the pathwidth of some grid-like graphs
John Ellis, Robert Warren
openalex +1 more source
A Quartic Kernel for Pathwidth-One Vertex Deletion
Geevarghese Philip+2 more
openalex +2 more sources
Finding Light Spanners in Bounded Pathwidth Graphs
Michelangelo Grigni, Hao-Hsiang Hung
openalex +2 more sources
Exponential Steepest Ascent from Valued Constraint Graphs of Pathwidth Four [PDF]
We examine the complexity of maximising fitness via local search on valued constraint satisfaction problems (VCSPs). We consider two kinds of local ascents: (1) steepest ascents, where each step changes the domain that produces a maximal increase in ...
Artem Kaznatcheev, Melle van Marle
semanticscholar +2 more sources
Graph Homomorphism, Monotone Classes and Bounded Pathwidth [PDF]
In recent work by Johnson et al. (2022), a framework was described for the study of graph problems over classes specified by omitting each of a finite set of graphs as subgraphs. If a problem falls into the framework then its computational complexity can
Tala Eagling-Vose+4 more
semanticscholar +2 more sources