Maximum information stored in a labeled connected network with minimum edges

DOI10.1007/s10898-010-9602-0zbMath1228.90135OpenAlexW1968907567MaRDI QIDQ548186

Chao-Lin Chen

Publication date: 28 June 2011

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-010-9602-0

zbMATH Keywords

labeled connected graphstorage networksubset interconnection designs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• On the complexity of an optimal routing tree problem
• Some simplified NP-complete graph problems
• On complexity of subset interconnection designs
• The asymptotic number of labeled connected graphs with a given number of vertices and edges