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

Maximum common induced subgraph (MCIS) of a communication network graph database determine the common substructures which are always active and retain the links between any pair of nodes exactly as in all graphs of the database. Many benchmark graph algorithms to predict MCIS of a graph database dea...

Full description

Saved in:
Bibliographic Details
Published in:Knowledge and information systems Vol. 48; no. 1; pp. 229 - 252
Main Authors: Nirmala, Parisutham, Lekshmi, Ramasubramony Sulochana, Nadarajan, Rethnasamy
Format: Journal Article
Language:English
Published: London Springer London 01.07.2016
Springer Nature B.V
Subjects:
Algorithms
Analysis
Communication
Communication networks
Communications networks
Computer Science
Data mining
Data Mining and Knowledge Discovery
Database Management
Graph theory
Graphs
Information retrieval
Information Storage and Retrieval
Information Systems and Communication Service
Information Systems Applications (incl.Internet)
Isomorphism
IT in Business
Labels
Pattern recognition
Regular Paper
Searching
Social networks
Studies
Time series
Trees
Similarity pattern
Subgraph isomorphism
Information extraction
Communication networks
Substructure mining
Graph algorithm
Graph mining
ISSN:0219-1377, 0219-3116
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Maximum common induced subgraph (MCIS) of a communication network graph database determine the common substructures which are always active and retain the links between any pair of nodes exactly as in all graphs of the database. Many benchmark graph algorithms to predict MCIS of a graph database deal only with two graphs at a time and seek isomorphism, for which a high computational cost is to be paid. This gradually reduces the performance of the existing algorithms when the database has huge graph data. The proposed binary caterpillar MCIS algorithm to predict all MCIS of the database works for communication network graph database each of whose vertices has a unique label (IP address). In this, a new data structure which is a caterpillar-based binary tree is defined to reduce the search space of the problem using the concept of vertex cover and it takes into account all graphs of the database simultaneously to predict all MCIS of the database. This has substantially reduced unwanted comparisons among the datasets, when compared to the existing algorithms, as well as the difficulty of seeking isomorphism is avoided due to unique vertex labels. The experimental results further ensure the efficiency of the proposed algorithm with respect to existing works.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0219-1377
0219-3116
DOI:10.1007/s10115-015-0874-z