Login / Signup
Complexity aspects of the computation of the rank of a graph.
Igor da Fonseca Ramos
Vinícius F. dos Santos
Jayme Luiz Szwarcfiter
Published in:
Discret. Math. Theor. Comput. Sci. (2014)
Keyphrases
</>
connected components
artificial intelligence
polynomial time complexity
computational complexity
random walk
graph mining
stable set
graph based algorithm
bounded treewidth
graph theoretic
complexity analysis
graph representation
graph model
directed acyclic graph
computational cost
np hard
optimal solution