Approximating the minimum strongly connected subgraph via a matching lower bound (Q2768327)
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: Approximating the minimum strongly connected subgraph via a matching lower bound |
scientific article; zbMATH DE number 1699255
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the minimum strongly connected subgraph via a matching lower bound |
scientific article; zbMATH DE number 1699255 |
Statements
30 January 2002
0 references
approximation algorithm
0 references
spanning subgraph
0 references
directed graph
0 references
matching
0 references
Approximating the minimum strongly connected subgraph via a matching lower bound (English)
0 references
