search result

Cover von Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams

Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams

Year: 2017
Media group: LIPIcs
Cover von Algorithm Engineering for All-Pairs Suffix-Prefix Matching

Algorithm Engineering for All-Pairs Suffix-Prefix Matching

Year: 2017
Media group: LIPIcs
Cover von Polynomial Self-Stabilizing Maximum Matching Algorithm with Approximation Ratio 2/3

Polynomial Self-Stabilizing Maximum Matching Algorithm with Approximation Ratio 2/3

Year: 2017
Media group: LIPIcs
Cover von On the Complexity of Matching Cut in Graphs of Fixed Diameter

On the Complexity of Matching Cut in Graphs of Fixed Diameter

Year: 2016
Media group: LIPIcs
Cover von A Robust and Optimal Online Algorithm for Minimum Metric Bipartite Matching

A Robust and Optimal Online Algorithm for Minimum Metric Bipartite Matching

Year: 2016
Media group: LIPIcs
Cover von Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs

Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs

Year: 2016
Media group: LIPIcs
Cover von Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs

Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs

Year: 2016
Media group: LIPIcs
Cover von Sampling-Based Bottleneck Pathfinding with Applications to Frechet Matching

Sampling-Based Bottleneck Pathfinding with Applications to Frechet Matching

Year: 2016
Media group: LIPIcs
Cover von On the Power of Advice and Randomization for Online Bipartite Matching

On the Power of Advice and Randomization for Online Bipartite Matching

Year: 2016
Media group: LIPIcs
Cover von New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching

New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching

Year: 2016
Media group: LIPIcs
OPEN V 11.1.0.0