Linear-time parameterized algorithms with limited local resources
From MaRDI portal
Publication:2105436
Recommendations
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- The Power of Linear-Time Data Reduction for Maximum Matching
- The power of linear-time data reduction for maximum matching
- Data Reduction for Maximum Matching on Real-World Graphs
- Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
Cites work
- scientific article; zbMATH DE number 432790 (Why is no real title available?)
- A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Data streams: algorithms and applications.
- Data structures for weighted matching and extensions to \(b\)-matching and \(f\)-factors
- Dynamic parameterized problems and algorithms
- Introduction to algorithms.
- Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams
- Kernelization. Theory of parameterized preprocessing
- Maximum matching and a polyhedron with 0,1-vertices
- On graph problems in a semi-streaming model
- Parameterized Streaming: Maximal Matching and Vertex Cover
- Streaming algorithms for estimating the matching size in planar graphs and beyond
- Streaming kernelization
- Sublinear time algorithms
- The Power of Linear-Time Data Reduction for Maximum Matching
- Towards a theory of parameterized streaming algorithms
- Undirected single-source shortest paths with positive integer weights in linear time
Cited in
(3)
This page was built for publication: Linear-time parameterized algorithms with limited local resources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2105436)