Hardness Results and Efficient Algorithms for Graph Powers


The k-th power H of a graph H is obtained from H by adding new edges between every two distinct vertices having distance at most k in H . Lau [Bipartite roots of graphs, ACM Transactions on Algorithms 2 (2006) 178–208] conjectured that recognizing k-th powers of some graph is NP-complete for all fixed k ≥ 2 and recognizing k-th powers of a bipartite graph… (More)
DOI: 10.1007/978-3-642-11409-0_21


3 Figures and Tables

Slides referencing similar topics