Maximum information stored in a labeled connected network with minimum edges

DOI10.1007/S10898-010-9602-0MaRDI QIDQ548186zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 3970793
• Structural routability of \(n\)-pairs information networks
• An optimal labeling for node connectivity
• Maximal entropy coverings and the information dimension of a complex network
• Approximating minimum size \{1,2\}-connected networks
• Effective storage capacity of labeled graphs
• Maximizing information exchange between complex networks
• A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
• On sphere-regular graphs and the extremality of information-theoretic network measures

Cites work

• scientific article; zbMATH DE number 5070513 (Why is no real title available?)
• On complexity of subset interconnection designs
• On the complexity of an optimal routing tree problem
• Some simplified NP-complete graph problems
• The asymptotic number of labeled connected graphs with a given number of vertices and edges

Cited in

(1)

• Effective storage capacity of labeled graphs

This page was built for publication: Maximum information stored in a labeled connected network with minimum edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548186)