1-Approximation algorithm for bottleneck disjoint path matching (Q672495)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: 1-Approximation algorithm for bottleneck disjoint path matching |
scientific article; zbMATH DE number 985030
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 1-Approximation algorithm for bottleneck disjoint path matching |
scientific article; zbMATH DE number 985030 |
Statements
1-Approximation algorithm for bottleneck disjoint path matching (English)
0 references
28 February 1997
0 references
algorithms
0 references
approximation algorithms
0 references
graph
0 references
matching
0 references
path matching
0 references
0 references
