Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight (Q3032100)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight |
scientific article |
Statements
Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight (English)
0 references
1990
0 references
covering
0 references
vertex-disjoint paths
0 references
total weight
0 references
undirected graphs
0 references
maximum weight matching algorithm
0 references
bipartite graphs
0 references
