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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Knowledge and information systems Ročník 48; číslo 1; s. 229 - 252
Hlavní autori:	Nirmala, Parisutham, Lekshmi, Ramasubramony Sulochana, Nadarajan, Rethnasamy
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	London Springer London 01.07.2016 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!