121 citations · 153 across the 25 of their papers we have counts for
Showing 2019 · cs.DSShow all
3 papers · 2 filters
cs.DS2019★ 1 cited
Linear-Time Recognition of Double-Threshold Graphs
Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi +1
A graph is a double-threshold graph if there exist a vertex-weight function and two real numbers s…
cs.DS2019
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama +2
Motivated by adjacency in perfect matching polytopes, we study the shortest reconfiguration problem of perfect matchings via alternating cycles. Namely, we want to find a shortest…
cs.DS2019
Subgraph Isomorphism on Graph Classes that Exclude a Substructure
Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi +4
We study Subgraph Isomorphism on graph classes defined by a fixed forbidden graph. Although there are several ways for forbidding a graph, we observe that it is reasonable to focus…