Nirmala, P., Lekshmi, R. S., & Nadarajan, R. (2016). Vertex cover-based binary tree algorithm to detect all maximum common induced subgraphs in large communication networks. Knowledge and information systems, 48(1), 229-252. https://doi.org/10.1007/s10115-015-0874-z
Citace podle Chicago (17th ed.)Nirmala, Parisutham, Ramasubramony Sulochana Lekshmi, a Rethnasamy Nadarajan. "Vertex Cover-based Binary Tree Algorithm to Detect All Maximum Common Induced Subgraphs in Large Communication Networks." Knowledge and Information Systems 48, no. 1 (2016): 229-252. https://doi.org/10.1007/s10115-015-0874-z.
Citace podle MLA (9th ed.)Nirmala, Parisutham, et al. "Vertex Cover-based Binary Tree Algorithm to Detect All Maximum Common Induced Subgraphs in Large Communication Networks." Knowledge and Information Systems, vol. 48, no. 1, 2016, pp. 229-252, https://doi.org/10.1007/s10115-015-0874-z.