Bipartition constrained edge-splitting in directed graphs (Q5954237)
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: Bipartition constrained edge-splitting in directed graphs |
scientific article; zbMATH DE number 1699126
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bipartition constrained edge-splitting in directed graphs |
scientific article; zbMATH DE number 1699126 |
Statements
Bipartition constrained edge-splitting in directed graphs (English)
0 references
2001
0 references
digraph
0 references
splitting off edges
0 references
bipartition
0 references
polynomial algorithm
0 references
edge-connectivity augmentation problem
0 references
