Density decompositions of networks
From MaRDI portal
Publication:5233139
DOI10.7155/jgaa.00505zbMath1419.05174arXiv1405.1001OpenAlexW2972649475MaRDI QIDQ5233139
Gordon Wilfong, Theresa Migler, Glencora Borradaile
Publication date: 16 September 2019
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.1001
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (2)
Decreasing minimization on M-convex sets: background and structures ⋮ Decreasing minimization on M-convex sets: algorithms and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(k\)-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases
- Size and connectivity of the \(k\)-core of a random graph
- Balanced vertex-orderings of graphs
- Minimizing maximum indegree
- Sudden emergence of a giant \(k\)-core in a random graph
- Upper and lower degree-constrained graph orientation with minimum penalty
- Fast algorithms for determining (generalized) core groups in social networks
- Emergence of Scaling in Random Networks
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
- GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
- Uniform generation of random regular graphs of moderate degree
- Smallest-last ordering and clustering and graph coloring algorithms
- Egalitarian Graph Orientations
- Collective dynamics of ‘small-world’ networks
- Arboricity and spanning-tree packing in random graphs with an application to load balancing
- Machine Learning: ECML 2004
- Semi-matchings for bipartite graphs and load balancing
- Computing and Combinatorics
- Networks
- Generating random regular graphs
This page was built for publication: Density decompositions of networks
