| Title:
|
A note on the computational complexity of computing the edge rotation distance between graphs (English) |
| Title:
|
Poznámka o výpočetní složitosti výpočtu hranově rotační vzdálenosti mezi grafy (Czech) |
| Author:
|
Křivánek, Mirko |
| Language:
|
English |
| Journal:
|
Časopis pro pěstování matematiky |
| ISSN:
|
0528-2195 |
| Volume:
|
113 |
| Issue:
|
1 |
| Year:
|
1988 |
| Pages:
|
52-55 |
| Summary lang:
|
English |
| Summary lang:
|
Czech |
| Summary lang:
|
Russian |
| . |
| Category:
|
math |
| . |
| MSC:
|
68R10 |
| idZBL:
|
Zbl 0635.68072 |
| idMR:
|
MR930805 |
| DOI:
|
10.21136/CPM.1988.118331 |
| . |
| Date available:
|
2009-09-23T09:45:32Z |
| Last updated:
|
2020-07-29 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/118331 |
| . |
| Reference:
|
[1] G. Chartrand F. Saba H. Zou: Edge rotations and distance between graphs.Časopispěst. mat. 100 (1975), 371-373. |
| Reference:
|
[2] M. R. Garey D. S. Johnson: Computers and Intractability: a guide to the theory of NP-copleteness.Freeman, San Francisco, 1979. MR 0519066 |
| . |
