Fast approximation for computing the fractional arboricity and extraction of communities of a graph

DOI10.1016/j.dam.2014.10.023zbMath1344.05137OpenAlexW1983792994MaRDI QIDQ313816

Jérôme Galtier, Bio Mikaila Toko Worou

Publication date: 12 September 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.10.023

zbMATH Keywords

social networkscommunity detectionFPTASfractional arboricitynested clustering

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Graph algorithms (graph-theoretic aspects) (05C85) Density (toughness, etc.) (05C42)

Related Items

Computing Weighted Strength and Applications to Partitioning, Arboricity games: the core and the nucleolus, Fast approximation of matroid packing and covering, A Constructive Arboricity Approximation Scheme

Cites Work

• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Communication networks from the enron email corpus ``It's always about the people. Enron is no different
• Packing algorithms for arborescences (and spanning trees) in capacitated graphs
• A short proof of Nash-Williams' theorem for the arboricity of a graph
• Evolution of the social network of scientific collaborations
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Computing Communities in Large Networks Using Random Walks
• Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
• Minimum partition of a matroid into independent subsets