A degree sequence problem related to network design
From MaRDI portal
Publication:4303623
DOI10.1002/net.3230240402zbMath0820.90043MaRDI QIDQ4303623
Bienstock, Daniel, Oktay Günlük
Publication date: 29 August 1994
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230240402
lightwave networks; design of a target graph; intermediate connection networks; minimum number of intermediate graphs
90C35: Programming involving graphs or networks
90C90: Applications of mathematical programming
90C10: Integer programming
90B18: Communication networks in operations research
Related Items
Configuring Random Graph Models with Fixed Degree Sequences, Influence of assortativity and degree-preserving rewiring on the spectra of networks, A family of switch equivalent graphs, Making multigraphs simple by a sequence of double edge swaps