Results 131 to 140 of about 3,161 (171)

On exploring always-connected temporal graphs of small pathwidth

open access: yesInformation Processing Letters, 2019
H. Bodlaender, Tom C. van der Zanden
semanticscholar   +1 more source

A Quartic Kernel for Pathwidth-One Vertex Deletion

open access: green, 2010
Geevarghese Philip   +2 more
openalex   +2 more sources

Exponential Steepest Ascent from Valued Constraint Graphs of Pathwidth Four [PDF]

open access: greenInternational Conference on Principles and Practice of Constraint Programming
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]

open access: greenConference on Computability in Europe
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

Home - About - Disclaimer - Privacy