Showing 2018Show all
2 papers · 1 filter
cs.CC2018
Partial complementation of graphs
Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme +1
A partial complement of the graph is a graph obtained from by complementing all the edges in one of its induced subgraphs. We study the following algorithmic question: for…
cs.CC2018
Generalized distance domination problems and their complexity on graphs of bounded mim-width
Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme +1
We generalize the family of -problems and locally checkable vertex partition problems to their distance versions, which naturally captures well-known problems such as dista…