5 citations · 6 across the 5 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
Shortest Reconfiguration of Matchings
Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito +1
Imagine that unlabelled tokens are placed on the edges of a graph, such that no two tokens are placed on incident edges. A token can jump to another edge if the edges having tokens…
cs.DS2018
How to Secure Matchings Against Edge Failures
Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
Suppose we are given a bipartite graph that admits a perfect matching and an adversary may delete any edge from the graph with the intention of destroying all perfect matchings. We…