Space-efficient approximation scheme for maximum matching in sparse graphs (Q4608587)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6851861
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Space-efficient approximation scheme for maximum matching in sparse graphs |
scientific article; zbMATH DE number 6851861 |
Statements
21 March 2018
0 references
maximum matching
0 references
approximation scheme
0 references
logspace
0 references
planar graphs
0 references
Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs (English)
0 references
0.7602659463882446
0 references
0.7562164068222046
0 references
0.7534171342849731
0 references
0.753145158290863
0 references
