Journal of Graph Algorithms and Applications Computational Aspects of Lucidity-driven Graph Clustering

No abstract is available for this paper.

• Publication year

  year unknown

• Venue

  Unknown venue

• Publication date

  Unknown publication date

• Fields of study

  Not labeled

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Computers And Intractability A Guide To The Theory Of Np Completeness

  2016cited by this paper
• Encyclopedia of Complexity and Systems Science

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

  2008cited by this paper
• On Modularity Clustering

  2008cited by this paper
• Extending the definition of modularity to directed graphs with overlapping communities

  2008cited by this paper
• Engineering graph clustering

  2008cited by this paper
• On Finding Graph Clusterings with Maximum Modularity

  2007cited by this paper
• Significance-Driven Graph Clustering

  2007cited by this paper
• Modularity and community structure in networks.

  2006cited by this paper
• Resolution limit in community detection

  2006cited by this paper
• Spatially Constrained Networks and the Evolution of Modular Control Systems

  2006cited by this paper
• Statistical mechanics of community detection.

  2006cited by this paper
• Comparing community structure identification

  2005cited by this paper
• Functional cartography of complex metabolic networks

  2005cited by this paper
• Efficient and simple generation of random simple connected graphs with prescribed degree sequence

  2005cited by this paper
• Network Analysis: Methodological Foundations (Lecture Notes in Computer Science)

  2005influential reference
• A Spectral Clustering Approach To Finding Communities in Graph

  2005cited by this paper
• Community detection in complex networks using extremal optimization.

  2005cited by this paper
• Local modularity measure for network clusterizations.

  2005cited by this paper
• Analysis of weighted networks.

  2004cited by this paper
• Finding community structure in very large networks.

  2004influential reference
• Information-theoretic approach to network modularity.

  2004cited by this paper
• Experiments on Graph Clustering Algorithms

  2003cited by this paper
• Fast algorithm for detecting community structure in networks.

  2003cited by this paper
• Origin of degree correlations in the Internet and other networks.

  2003cited by this paper
• Finding and evaluating community structure in networks.

  2003influential reference
• Dynamic planar convex hull

  2002cited by this paper
• On clusterings-good, bad and spectral

  2000cited by this paper
• Graph clustering by flow simulation

  2000cited by this paper
• Complexity and Approximation

  1999cited by this paper
• The Complexity of Multiterminal Cuts

  1994cited by this paper
• An Information Flow Model for Conflict and Fission in Small Groups

  1977cited by this paper

• Boosting Task Scheduling Data Locality with Low-latency, HW-accelerated Label Propagation

  2025cites this paper
• Agglomerative clustering for community detection in dynamic graphs

  2016cites this paper
• Engineering Graph Clustering Algorithms

  2015cites this paper
• A simple and fast exact clustering algorithm defined for complex networks and based on the properties of primes

  2014cites this paper
• Dynamic graph clustering combining modularity and smoothness

  2013cites this paper
• An algorithmic walk from static to dynamic graph clustering

  2010cites this paper
• Modularity-Driven Clustering of Dynamic Graphs

  2010cites this paper