Finding the longest isometric cycle in a graph

Discrete Applied Mathematics

Volumn 157, Issue 12, 2009, Pages 2670-2674

  Lokshtanov, Daniel ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

Induced cycle; Isometric cycle; Longest cycle; Polynomial time algorithm

Indexed keywords

GRAPH G; INDUCED CYCLE; ISOMETRIC CYCLE; LONGEST CYCLE; LONGEST CYCLE PROBLEM; NP COMPLETE; POLYNOMIAL TIME ALGORITHM; POLYNOMIAL-TIME;

POLYNOMIAL APPROXIMATION;

EID: 67349171865     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2008.08.008     Document Type: Article

References (4)

1. Coppersmith D., and Winograd S. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation 9 3 (1990) 251-280
2. Karp R.M. Reducibility among combinatorial problems. Complexity of Computer Computations (1972), Plenum Press 85-103
3. Garey M.R., and Johnson D.S. Computers and Intractability (1978), W.H. Freeman and Co.
4. West D.B. Introduction to Graph Theory. second ed. (2001), Prentice Hall p. 1