43 citations · 187 across the 40 of their papers we have counts for
Showing 2017 · cs.DSShow all
2 papers · 2 filters
cs.DS2017
A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs
George B. Mertzios, André Nichterlein, Rolf Niedermeier
Finding maximum-cardinality matchings in undirected graphs is arguably one of the most central graph problems. For general m-edge and n-vertex graphs, it is well-known to be solvab…
cs.DS2017
Binary Search in Graphs Revisited
Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis
In the classical binary search in a path the aim is to detect an unknown target by asking as few queries as possible, where each query reveals the direction to the target. This bin…