Publication

Round Compression for Parallel Matching Algorithms

Related publications (47)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Node-weighted network design and maximum sub-determinants

Carsten Moldenhauer

We consider the Node-weighted Steiner Forest problem on planar graphs. Demaine et al. showed that a generic primal-dual algorithm gives a 6-approximation. We present two different proofs of an approximation factor of~

3

. Then, we draw a connection to Goem ...

EPFL2014

Round Compression for Parallel Matching Algorithms

Graph Chatbot

Chat with Graph Search

Growing a Graph Matching from a Handful of Seeds

Node-weighted network design and maximum sub-determinants

Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition

On the Performance of Percolation Graph Matching

Navigating Central Path with Electrical Flows: from Flows to Matchings, and Back

An algorithmic decomposition of claw-free graphs leading to an O(n^3) algorithm for the weighted stable set problem

Computational performance of a parallelized three-dimensional high-order spectral element toolbox

Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid

Graph-based classification of multiple observation sets

Weighted coloring on planar, bipartite and split graphs: Complexity and approximation

Growing a Graph Matching from a Handful of Seeds

Computational performance of a parallelized three-dimensional high-order spectral element toolbox

Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid

Navigating Central Path with Electrical Flows: from Flows to Matchings, and Back

Weighted coloring on planar, bipartite and split graphs: Complexity and approximation

An algorithmic decomposition of claw-free graphs leading to an O(n^3) algorithm for the weighted stable set problem

Node-weighted network design and maximum sub-determinants

On the Performance of Percolation Graph Matching

Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition

Graph-based classification of multiple observation sets