Login / Signup
Complexity results on w-well-covered graphs.
Vadim E. Levit
David Tankus
Published in:
CoRR (2014)
Keyphrases
</>
graph matching
real time
information systems
multiscale
graph theory
space complexity
graph clustering
genetic algorithm
pairwise
decision problems
graph mining
graph databases
spanning tree
graph theoretic
series parallel
polynomial time complexity