Centrality measures-based algorithm to visualize a maximal common induced subgraph in large communication networks

Published 2015 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Centrality measures-based algorithm to visualize a maximal common induced subgraph in large communication networks
Authors
Keywords
Communication networks, Similarity pattern, Graph mining, Substructure mining, Information extraction, Graph algorithm
Journal
KNOWLEDGE AND INFORMATION SYSTEMS
Volume 46, Issue 1, Pages 213-239
Publisher
Springer Nature
Online
2015-05-29
DOI
10.1007/s10115-015-0844-5
References
View 3 related references

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.