Efficient Implementation of Anchored 2-core Algorithm

No abstract is available for this paper.

• Publication year

  2017

• Venue

  International Conference on Advances in Social Networks Analysis and Mining

• Publication date

  2017-07-31

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/3110025.3120959
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Efficient Computation of Feedback Arc Set at Web-Scale

  2016cited by this paper
• Efficient Computation of Importance Based Communities in Web-Scale Networks Using a Single Machine

  2016cited by this paper
• K-Core Decomposition of Large Networks on a Single PC

  2015influential reference
• Clearing contamination in large networks

  2014cited by this paper
• Hardness of peeling with stashes

  2014cited by this paper
• Core decomposition of uncertain graphs

  2014cited by this paper
• Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs

  2013cited by this paper
• Arrival and departure dynamics in social networks

  2013cited by this paper
• Social resilience in online communities: the autopsy of friendster

  2013cited by this paper
• Preventing Unraveling in Social Networks Gets Harder

  2013cited by this paper
• Preventing Unraveling in Social Networks: The Anchored k-Core Problem

  2012influential reference
• Fast algorithms for determining (generalized) core groups in social networks

  2011cited by this paper
• Algorithms, 4th Edition

  2011cited by this paper
• The k-Cores of a Graph

  2010cited by this paper
• Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks

  2010cited by this paper
• A complex network approach to text summarization

  2009cited by this paper
• Feed me: motivating newcomer contribution in social network sites

  2009cited by this paper
• k-core (bootstrap) percolation on complex networks: Critical phenomena and nonlocal effects

  2006cited by this paper
• K-core decomposition of Internet graphs: hierarchies, self-similarity and measurement biases

  2005cited by this paper
• Evolutionary cores of domain co-occurrence networks

  2005cited by this paper
• K-core Organization of Complex Networks

  2005influential reference
• The webgraph framework I: compression techniques

  2004influential reference
• UbiCrawler: a scalable fully distributed Web crawler

  2004cited by this paper
• An O(m) Algorithm for Cores Decomposition of Networks

  2003cited by this paper
• The Link Database: fast access to graphs of the Web

  2002cited by this paper
• WebBase: a repository of Web pages

  2000cited by this paper
• The Connectivity Server: Fast Access to Linkage Information on the Web

  1998cited by this paper

• Maximizing resilience in large-scale social networks

  2022cites this paper
• Anchored coreness: efficient reinforcement of social networks

  2021cites this paper
• Global Reinforcement of Social Networks: The Anchored Coreness Problem

  2020cites this paper
• Truss decomposition in large probabilistic graphs

  2019cites this paper
• Data Structures for Efficient Computation of Influence Maximization and Influence Estimation

  2018cites this paper
• K-Truss Decomposition of Large Networks on a Single Consumer-Grade Machine

  2018cites this paper
• Efficient algorithms for discovering importance-based communities in large web-scale networks

  2017cites this paper