Finding a Dense-Core in Jellyfish Graphs

DOI10.1007/978-3-540-77004-6_3zbMath1136.68327OpenAlexW1832159471MaRDI QIDQ5458298

Udi Weinsberg, Dana Ron, Mira Gonen, Avishai Wool

Publication date: 11 April 2008

Published in: Algorithms and Models for the Web-Graph (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.2122

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

Related Items (1)

Finding a Dense-Core in Jellyfish Graphs

Cites Work

• Unnamed Item
• A new conceptual clustering framework
• \(k\)-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases
• A geographic directed preferential internet topology model
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• A local-world evolving network model
• Clique is hard to approximate within \(n^{1-\epsilon}\)
• Approximation Algorithms for Maximization Problems Arising in Graph Partitioning
• Property testing and its connection to learning and approximation
• Attack Resistance of Power-Law Random Graphs in the Finite-Mean, Infinite-Variance Region
• Greedily Finding a Dense Subgraph
• Finding a Dense-Core in Jellyfish Graphs
• The dense \(k\)-subgraph problem

This page was built for publication: Finding a Dense-Core in Jellyfish Graphs