An in-place maximum matching algorithm for graphs of minimum degree 5
From MaRDI portal
Cites work
- \(\widetilde{O}(\sqrt{n})\)-space and polynomial-time algorithm for planar directed graph reachability
- Approximating matching size from random streams
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Depth-First Search Using O(n) Bits
- Frameworks for designing in-place graph algorithms
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- Improved space efficient algorithms for BFS, DFS and applications
- In-place algorithms for computing a largest clique in geometric intersection graphs
- Maximum matching in semi-streaming with few passes
- Maximum matchings via Gaussian elimination
- New time-space upperbounds for directed reachability in high-genus and H-minor-free graphs
- Optimal In-place Algorithms for Basic Graph Problems
- Paths, Trees, and Flowers
- Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples
- Space-efficient basic graph algorithms
- Space-efficient biconnected components and recognition of outerplanar graphs
- The theory of regular graphs
- Tight Lower Bounds for st-Connectivity on the NNJAG Model
This page was built for publication: An in-place maximum matching algorithm for graphs of minimum degree 5
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7444394)