ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES (Q3065608): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0129054107005054 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2058687965 / rank | |||
Normal rank | |||
Latest revision as of 10:33, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES |
scientific article |
Statements
ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES (English)
0 references
6 January 2011
0 references
algorithmic graph theory
0 references
design and analysis of algorithms
0 references
graph classes
0 references
longest path problem
0 references
0 references
