Geodesic
A note on the computational complexity of computing the edge rotation distance between graphs
Časopis pro pěstování matematiky, Tome 113 (1988) no. 1, pp. 52-55

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

DOI MR   Zbl

DOI : 10.21136/CPM.1988.118331
Classification : 68R10 
Křivánek, Mirko. A note on the computational complexity of computing the edge rotation distance between graphs. Časopis pro pěstování matematiky, Tome 113 (1988) no. 1, pp. 52-55. doi: 10.21136/CPM.1988.118331
@article{10_21136_CPM_1988_118331,
     author = {K\v{r}iv\'anek, Mirko},
     title = {A note on the computational complexity of computing the edge rotation distance between graphs},
     journal = {\v{C}asopis pro p\v{e}stov\'an{\'\i} matematiky},
     pages = {52--55},
     year = {1988},
     volume = {113},
     number = {1},
     doi = {10.21136/CPM.1988.118331},
     mrnumber = {930805},
     zbl = {0635.68072},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CPM.1988.118331/}
}
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
SP  - 52
EP  - 55
VL  - 113
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CPM.1988.118331/
DO  - 10.21136/CPM.1988.118331
LA  - en
ID  - 10_21136_CPM_1988_118331
ER  - 
%0 Journal Article
%A Křivánek, Mirko
%T A note on the computational complexity of computing the edge rotation distance between graphs
%J Časopis pro pěstování matematiky
%D 1988
%P 52-55
%V 113
%N 1
%U http://geodesic.mathdoc.fr/articles/10.21136/CPM.1988.118331/
%R 10.21136/CPM.1988.118331
%G en
%F 10_21136_CPM_1988_118331

[1] G. Chartrand F. Saba H. Zou: Edge rotations and distance between graphs. Časopispěst. mat. 100 (1975), 371-373.

[2] M. R. Garey D. S. Johnson: Computers and Intractability: a guide to the theory of NP-copleteness. Freeman, San Francisco, 1979. | MR

Cité par Sources :