New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness (Q4606313): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| label / en | label / en | ||
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness | |||
| Property / full work available at URL | |||
| Property / full work available at URL: http://dx.doi.org/10.4230/LIPIcs.ESA.2016.42 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2964080336 / rank | |||
Normal rank | |||
| Property / title | |||
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness (English) | |||
| Property / title: New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness (English) / rank | |||
Normal rank | |||
Revision as of 10:26, 30 July 2024
scientific article; zbMATH DE number 6846413
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness |
scientific article; zbMATH DE number 6846413 |
Statements
2 March 2018
0 references
disjoint paths
0 references
approximation algorithms
0 references
feedback vertex set
0 references
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness (English)
0 references
