Pages that link to "Item:Q4608587"
From MaRDI portal
The following pages link to Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs (Q4608587):
Displaying 8 items.
- Improved induced matchings in sparse graphs (Q608287) (← links)
- Space-efficient biconnected components and recognition of outerplanar graphs (Q666673) (← links)
- Frameworks for designing in-place graph algorithms (Q2237887) (← links)
- Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays. (Q5005169) (← links)
- Planar Maximum Matching: Towards a Parallel Algorithm (Q5091011) (← links)
- Simple 2^f-Color Choice Dictionaries (Q5091061) (← links)
- Data Reduction for Maximum Matching on Real-World Graphs (Q5102046) (← links)
- Space-efficient graph kernelizations (Q6636090) (← links)
