Reducing large graphs to small supergraphs: a unified approach

No abstract is available for this paper.

• Publication year

  2018

• Venue

  Social Network Analysis and Mining

• Publication date

  2018-03-10

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s13278-018-0491-4
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Project

  2019cited by this paper
• Scalable Hashing-Based Network Discovery

  2017cited by this paper
• Individual and Collective Graph Mining: Principles, Algorithms, and Applications

  2017cited by this paper
• ECOviz : Comparative Visualization of Time-Evolving Network Summaries

  2017cited by this paper
• Exploratory Analysis of Graph Data by Leveraging Domain Knowledge

  2017cited by this paper
• Edge Labeling Schemes for Graph Data

  2017cited by this paper
• PERSEUS-HUB: Interactive and Collective Exploration of Large-Scale Graphs

  2017cited by this paper
• A Graph Summarization: A Survey

  2016cited by this paper
• Methods and Applications of Network Sampling

  2016cited by this paper
• TimeCrunch: Interpretable Dynamic Graph Summarization

  2015cited by this paper
• An Empirical Comparison of the Summarization Power of Graph Clustering Methods

  2015cited by this paper
• Beyond Blocks: Hyperbolic Community Detection

  2014influential reference
• {SNAP Datasets}: {Stanford} Large Network Dataset Collection

  2014influential reference
• Summarizing and understanding large graphs

  2014influential reference
• Patterns amongst Competing Task Frequencies: Super-Linearities, and the Almond-DG Model

  2013cited by this paper
• Distributed large-scale natural graph factorization

  2013cited by this paper
• Overlapping community detection at scale: a nonnegative matrix factorization approach

  2013influential reference
• Spectral sparsification of graphs: theory and algorithms

  2013cited by this paper
• Sparsification of influence networks

  2011cited by this paper
• Unifying Guilt-by-Association Approaches: Theorems and Fast Algorithms

  2011cited by this paper
• Evaluating Cooperation in Communities with the k-Core Structure

  2011cited by this paper
• Beyond 'Caveman Communities': Hubs and Spokes for Graph Compression and Mining

  2011influential reference
• Empirical comparison of algorithms for network community detection

  2010cited by this paper
• GraSS: Graph Structure Summarization

  2010cited by this paper
• Sampling community structure

  2010cited by this paper
• EigenSpokes: Surprising Patterns and Scalable Community Chipping in Large Graphs

  2009cited by this paper
• Community detection in graphs

  2009cited by this paper
• On compressing social networks

  2009cited by this paper
• Graph sparsification by effective resistances

  2008cited by this paper
• Metropolis Algorithms for Representative Subgraph Sampling

  2008cited by this paper
• Fast unfolding of communities in large networks

  2008cited by this paper
• Preferential behavior in online groups

  2008cited by this paper
• Graph summarization with bounded error

  2008influential reference
• On data mining, compression, and Kolmogorov complexity

  2007influential reference
• An Efficient MATLAB Algorithm for Graph Partitioning

  2006cited by this paper
• Group formation in large social networks: membership, growth, and evolution

  2006cited by this paper
• Graphs over time: densification laws, shrinking diameters and possible explanations

  2005cited by this paper
• Elements of Information Theory

  2005cited by this paper
• Effectively visualizing large networks through sampling

  2005cited by this paper
• Fully automatic cross-associations

  2004cited by this paper
• Clustering by compression

  2003cited by this paper
• Representing Web graphs

  2003cited by this paper
• Community structure in social and biological networks

  2001cited by this paper
• Multilevel k-way hypergraph partitioning

  1999influential reference
• The Web as a Graph: Measurements, Models, and Methods

  1999cited by this paper
• On power-law relationships of the Internet topology

  1999cited by this paper
• Substructure Discovery Using Minimum Description Length and Background Knowledge

  1993cited by this paper
• A UNIVERSAL PRIOR FOR INTEGERS AND ESTIMATION BY MINIMUM DESCRIPTION LENGTH

  1983influential reference
• The Transitive Reduction of a Directed Graph

  1972cited by this paper

• Learning to Compress Graphs via Dual Agents for Consistent Topological Robustness Evaluation

  2025cites this paper
• Mining structure overlaps for efficient graph compression

  2025cites this paper
• Temporal network compression via network hashing

  2023cites this paper
• DeepDense: Enabling node embedding to dense subgraph mining

  2023cites this paper
• Field-crossing social capital and patronage as cornerstones of the transnational OECD-PISA network infrastructure

  2023influential citation
• Extractive approach for text summarisation using graphs

  2021cites this paper
• pytwanalysis: Twitter Data Management And Analysis at Scale

  2021influential citation
• Hypergraph reconstruction from network data

  2020cites this paper
• The minimum description length principle for pattern mining: a survey

  2020cites this paper
• A coarse graining algorithm based on m-order degree in complex network

  2020cites this paper
• Coupled Clustering of Time-Series and Networks

  2019cites this paper
• Rapid, Progressive Sub-Graph Explorations for Interactive Visual Analytics over Large-Scale Graph Datasets

  2019cites this paper
• A Novel User-Centric Method for Graph Summarization Based on Syntactical and Semantical Attributes

  2018cites this paper
• A data reduction approach using hypergraphs to visualize communities and brokers in social networks

  2018cites this paper
• Compressing Networks with Super Nodes

  2017cites this paper