"Vertex cover-based binary tree algorithm to detect all maximum common ..."

Parisutham Nirmala, Lekshmi Ramasubramony Sulochana, Nadarajan Rethnasamy (2016)

> Home

Details and statistics

DOI: 10.1007/S10115-015-0874-Z

access: closed

type: Journal Article

metadata version: 2024-10-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/kais/NirmalaSR16a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/kais/NirmalaSR16a
Parisutham Nirmala, Lekshmi Ramasubramony Sulochana, Nadarajan Rethnasamy:
Vertex cover-based binary tree algorithm to detect all maximum common induced subgraphs in large communication networks. Knowl. Inf. Syst. 48(1): 229-252 (2016)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.