30 citations · 157 across the 83 of their papers we have counts for
Showing 2018 · cs.CCShow all
2 papers · 2 filters
cs.CC2018
Minimum Reload Cost Graph Factors
Julien Baste, Didem Gözüpek, Mordechai Shalom +1
The concept of Reload cost in a graph refers to the cost that occurs while traversing a vertex via two of its incident edges. This cost is uniquely determined by the colors of the…
cs.CC2018★ 11 cited
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…