Complexity of Finding Graph Roots with Girth Conditions.

Babak Farzad Lap Chi Lau Van Bang Le Nguyen Ngoc Tuy

Published in: Algorithmica (2012)

Keyphrases

sufficient conditions
polynomial time complexity
graph representation
graph theory
maximum clique
directed graph
graph matching

environmental conditions
graph mining
dependency graph
graph theoretic
weighted graph
graph structure
bipartite graph

shortest path
computational cost
computational complexity
case study
space complexity
connected components
structured data

graphical representation
graph data
graph search
adjacency matrix
strongly connected
stable set