Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width (Q2798213)
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: Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width |
scientific article |
Statements
Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width (English)
0 references
4 April 2016
0 references
