ON THE HARDNESS OF RECOGNIZING BUNDLES IN TIME TABLE GRAPHS (Q5249051): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:26, 8 February 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
