New algorithms for maximum disjoint paths based on tree-likeness (Q1785205)
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: New algorithms for maximum disjoint paths based on tree-likeness |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New algorithms for maximum disjoint paths based on tree-likeness |
scientific article |
Statements
New algorithms for maximum disjoint paths based on tree-likeness (English)
0 references
28 September 2018
0 references
disjoint paths
0 references
approximation algorithm
0 references
feedback vertex set
0 references
fixed-parameter algorithm
0 references
0 references
0 references
0 references
