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ženo v:

Podrobná bibliografie
Vydáno v:	Knowledge and information systems Ročník 48; číslo 1; s. 229 - 252
Hlavní autoři:	Nirmala, Parisutham, Lekshmi, Ramasubramony Sulochana, Nadarajan, Rethnasamy
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	London Springer London 01.07.2016 Springer Nature B.V
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!