Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem (Q3611868)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem |
scientific article |
Statements
Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem (English)
0 references
3 March 2009
0 references
