Fast approximation for computing the fractional arboricity and extraction of communities of a graph
From MaRDI portal
Publication:313816
DOI10.1016/J.DAM.2014.10.023zbMATH Open1344.05137OpenAlexW1983792994MaRDI QIDQ313816FDOQ313816
Authors: Bio Mikaila Toko Worou, Jérôme Galtier
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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Social networks; opinion dynamics (91D30) Density (toughness, etc.) (05C42)
Cites Work
- 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
- Evolution of the social network of scientific collaborations
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Minimum partition of a matroid into independent subsets
- Computing Communities in Large Networks Using Random Walks
- Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
- Packing algorithms for arborescences (and spanning trees) in capacitated graphs
- A short proof of Nash-Williams' theorem for the arboricity of a graph
Cited In (4)
This page was built for publication: Fast approximation for computing the fractional arboricity and extraction of communities of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q313816)