A note on the computational complexity of computing the edge rotation distance between graphs
Časopis pro pěstování matematiky (1988)
- Volume: 113, Issue: 1, page 52-55
- ISSN: 0528-2195
Access Full Article
top
How to cite
topKřivánek, Mirko. "A note on the computational complexity of computing the edge rotation distance between graphs." Časopis pro pěstování matematiky 113.1 (1988): 52-55. <http://eudml.org/doc/21697>.
@article{Křivánek1988,
author = {Křivánek, Mirko},
journal = {Časopis pro pěstování matematiky},
keywords = {NP-completeness; edge rotation distance; trees; NP-hard},
language = {eng},
number = {1},
pages = {52-55},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {A note on the computational complexity of computing the edge rotation distance between graphs},
url = {http://eudml.org/doc/21697},
volume = {113},
year = {1988},
}
TY - JOUR
AU - Křivánek, Mirko
TI - A note on the computational complexity of computing the edge rotation distance between graphs
JO - Časopis pro pěstování matematiky
PY - 1988
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 113
IS - 1
SP - 52
EP - 55
LA - eng
KW - NP-completeness; edge rotation distance; trees; NP-hard
UR - http://eudml.org/doc/21697
ER -
References
top- G. Chartrand F. Saba H. Zou, Edge rotations and distance between graphs, Časopispěst. mat. 100 (1975), 371-373. (1975)
- M. R. Garey D. S. Johnson, Computers and Intractability: a guide to the theory of NP-copleteness, Freeman, San Francisco, 1979. (1979) MR0519066
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.