About DML-CZ | FAQ | Conditions of Use | Math Archives | Contact Us
  Previous |  Up |  Next

Article

First Page Preview
Křivánek, Mirko
A note on the computational complexity of computing the edge rotation distance between graphs. (English). Časopis pro pěstování matematiky, vol. 113 (1988), issue 1, pp. 52-55
MSC: 68R10 | MR 930805 | Zbl 0635.68072 | DOI: 10.21136/CPM.1988.118331
References:
[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 0519066
Partner of
EuDML logo