Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth (Q2938095)
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 Node-Disjoint Paths in Graphs with Bounded Treewidth |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth |
scientific article |
Statements
Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth (English)
0 references
13 January 2015
0 references
