Hardness Results and Efficient Algorithms for Graph Powers

Van Bang Le, Nguyen Ngoc Tuy. Hardness Results and Efficient Algorithms for Graph Powers. In Christophe Paul, Michel Habib, editors, Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers. Volume 5911 of Lecture Notes in Computer Science, pages 238-249, 2009. [doi]

Abstract

Abstract is missing.