6 citations · 9 across the 8 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2018
On the Complexity Landscape of Connected f -Factor Problems
R. Ganian, N. S. Narayanaswamy, S. Ordyniak +2
Let G be an undirected simple graph having n vertices and let f be a function defined to be f:V(G) -> {0,..., n-1}. An f-factor of G is a spanning subgraph H such that degree of a…
cs.CC2015
Reconfiguration on sparse graphs
Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan +2
A vertex-subset graph problem Q defines which subsets of the vertices of an input graph are feasible solutions. A reconfiguration variant of a vertex-subset problem asks, given two…