Document is current

Any future updates will be listed below

Vertex cover-based binary tree algorithm to detect all maximum common induced subgraphs in large communication networks

Crossref DOI link: https://doi.org/10.1007/s10115-015-0874-z

Published Online: 2015-08-22

Published Print: 2016-07

Update policy: https://doi.org/10.1007/springer_crossmark_policy

About CrossMark