ON THE HARDNESS OF RECOGNIZING BUNDLES IN TIME TABLE GRAPHS (Q5249051): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0129054100000235 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1984968303 / rank | |||
Normal rank | |||
Latest revision as of 08:53, 30 July 2024
scientific article; zbMATH DE number 6432053
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | ON THE HARDNESS OF RECOGNIZING BUNDLES IN TIME TABLE GRAPHS |
scientific article; zbMATH DE number 6432053 |
Statements
ON THE HARDNESS OF RECOGNIZING BUNDLES IN TIME TABLE GRAPHS (English)
0 references
29 April 2015
0 references
graph theory
0 references
combinatorial optimization
0 references
NP-hardness
0 references
railway application
0 references
