Výsledky vyhledávání - "F.2 Analysis of algorithms and problem complexity"

Nearly Optimal Communication and Query Complexity of Bipartite Matching Autor Blikstad, Joakim, Van Den Brand, Jan, Efron, Yuval, Mukhopadhyay, Sagnik, Nanongkai, Danupon

“…We settle the complexities of the maximum-cardinality bipartite matching problem (BMM) up to polylogarithmic factors in five models of computation: the…”
Získat plný text

Cut Query Algorithms with Star Contraction Autor Apers, Simon, Efron, Yuval, Gawrychowski, Pawel, Lee, Troy, Mukhopadhyay, Sagnik, Nanongkai, Danupon

“…We study the complexity of determining the edge connectivity of a simple graph with cut queries. We show that (i) there is a bounded-error randomized algorithm…”
Získat plný text

Efficient assembly consensus algorithms for divergent contig sets Autor Chateau, Annie, Davot, Tom, Lafond, Manuel

“…Assembly is a fundamental task in genome sequencing, and many assemblers have been made available in the last decade. Because of the wide range of possible…”
Získat plný text