Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem (Q3104631): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-25591-5_38 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W42843301 / rank | |||
Normal rank | |||
Latest revision as of 00:28, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem |
scientific article |
Statements
Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem (English)
0 references
16 December 2011
0 references
experimental algorithms
0 references
bidimensional algorithms
0 references
branch-decomposition
0 references
grid minor
0 references
longest path problem
0 references
