Publication

Round Compression for Parallel Matching Algorithms

Publications associées (47)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

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

Chattez avec 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

Node-weighted network design and maximum sub-determinants

On the Performance of Percolation Graph Matching

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

Growing a Graph Matching from a Handful of Seeds

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

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

Graph-based classification of multiple observation sets

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

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