Near Linear Time Approximation Schemes for Uncapacitated and Capacitated b–Matching Problems in Nonbipartite Graphs (Q5383977): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1307.4355 / rank | |||
Normal rank | |||
Latest revision as of 01:40, 20 April 2024
scientific article; zbMATH DE number 7069336
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Near Linear Time Approximation Schemes for Uncapacitated and Capacitated b–Matching Problems in Nonbipartite Graphs |
scientific article; zbMATH DE number 7069336 |
Statements
Near Linear Time Approximation Schemes for Uncapacitated and Capacitated b–Matching Problems in Nonbipartite Graphs (English)
0 references
20 June 2019
0 references
