Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

An efficient weighted graph aggregation algorithm

From MaRDI portal
Publication:2824580
Jump to:navigation, search

zbMATH Open1363.05244MaRDI QIDQ2824580FDOQ2824580


Authors: Baoli Hu, Jinguo You, Cuilian Zhou, Hongbo Cui, Yang Wang Edit this on Wikidata


Publication date: 6 October 2016

Published in: Journal of University of Science and Technology of China (Search for Journal in Brave)





Recommendations

  • Effective and efficient aggregation on uncertain graphs
  • Faster compression methods for a weighted graph using locality sensitive hashing
  • Mining weighted subgraphs in a single large graph
  • Graph summarization with quality guarantees
  • A graph clustering algorithm based on a clustering coefficient for weighted graphs


zbMATH Keywords

weighted graphcompression ratiograph summarizationgraph datagraph aggregation


Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)



Cited In (3)

  • Adaptive aggregation on graphs
  • Effective and efficient aggregation on uncertain graphs
  • Faster compression methods for a weighted graph using locality sensitive hashing





This page was built for publication: An efficient weighted graph aggregation algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2824580)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2824580&oldid=15747587"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 18:43. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki