Data Reduction for Maximum Matching on Real-World Graphs
From MaRDI portal
Recommendations
- Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
- The Power of Linear-Time Data Reduction for Maximum Matching
- The power of linear-time data reduction for maximum matching
- Experiments on data reduction for optimal domination in networks
- Density Maximization for Improving Graph Matching With Its Applications
- SOFSEM 2006: Theory and Practice of Computer Science
- Efficient random graph matching via degree profiles
- Space-efficient approximation scheme for maximum matching in sparse graphs
- Data reduction for graph coloring problems
- Data reduction for graph coloring problems
Cites work
- scientific article; zbMATH DE number 3767009 (Why is no real title available?)
- scientific article; zbMATH DE number 6917125 (Why is no real title available?)
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
- Blossom V: A new implementation of a minimum cost perfect matching algorithm
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
- Combinatorial optimization. Theory and algorithms
- Crown reductions for the minimum weighted vertex cover problem
- Crown structures for vertex cover kernelization
- Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
- Efficient and Adaptive Parameterized Algorithms on Modular Decompositions
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- Fully polynomial-time parameterized computations for graphs and matrices of low treewidth
- Graph-Theoretic Concepts in Computer Science
- Karp-Sipser based kernels for bipartite graph matching
- Linear-time FPT algorithms via network flow
- Linear-time approximation for maximum weight matching
- Matching is as easy as matrix inversion
- Maximum matching and a polyhedron with 0,1-vertices
- On adaptive algorithms for maximum matching
- On the König deficiency of zero-reducible graphs
- On the power of tree-depth for fully polynomial FPT algorithms
- Parameterized algorithms
- Paths, Trees, and Flowers
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs
- Reflections on multivariate algorithmics and problem parameterization
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
- Scaling algorithms for weighted matching in general graphs
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
- The power of linear-time data reduction for maximum matching
- Vertex packings: Structural properties and algorithms
Cited in
(9)- Linear-time parameterized algorithms with limited local resources
- There and back again: on applying data reduction rules by undoing others
- The power of linear-time data reduction for maximum matching
- A simple reduction from maximum weight matching to maximum cardinality matching
- Computing maximum matchings in temporal graphs
- Parameterized complexity of diameter
- A linear-time parameterized algorithm for computing the width of a DAG
- Effective data reduction for strongly stable matching in very sparse graphs
- The complexity of optimizing atomic congestion
This page was built for publication: Data Reduction for Maximum Matching on Real-World Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5102046)
