Login / Signup
Vertex cover-based binary tree algorithm to detect all maximum common induced subgraphs in large communication networks.
Parisutham Nirmala
Lekshmi Ramasubramony Sulochana
Nadarajan Rethnasamy
Published in:
Knowl. Inf. Syst. (2016)
Keyphrases
</>
binary tree
vertex cover
communication networks
computational complexity
dynamic programming
worst case
quadtree
approximation algorithms
optimal solution
polynomial time approximation
database systems
objective function
relational databases
expectation maximization
computer networks
log likelihood