Computing assortative mixing by degree with the \(s\)-metric in networks using linear programming
From MaRDI portal
Publication:305479
DOI10.1155/2015/580361zbMath1343.05143OpenAlexW2074396757WikidataQ59111902 ScholiaQ59111902MaRDI QIDQ305479
Verena D. Schmittmann, Lourens J. Waldorp
Publication date: 30 August 2016
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/580361
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Linear programming (90C05) Deterministic network models in operations research (90B10) Vertex degrees (05C07)
Uses Software
Cites Work
- Influence of assortativity and degree-preserving rewiring on the spectra of networks
- Optimizing over the subtour polytope of the travelling salesman problem
- Polyhedral proof methods in combinatorial optimization
- Emergence of Scaling in Random Networks
- Dynamical Processes on Complex Networks
- Validation of subgradient optimization
- Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees: Part II
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computing assortative mixing by degree with the \(s\)-metric in networks using linear programming
