Compression and expansion in graphs using overlays

DOI10.1002/NET.20411MaRDI QIDQ3113505zbMATH OpenOpenAlexWikidataFDO

Authors Bilal Khan, Kiran R. Bhutani

Publication date 18 January 2012

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20411

zbMATH Keywords

compressiondiameterexpansiongraph embeddingoverlays

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Network design and communication in computer systems (68M10)

Recommendations

• Physical expander in virtual tree overlay
• Towards fast decentralized construction of locality-aware overlay networks
• Xheal, localized self-healing using expanders
• Scalable expanders: exploiting hierarchical random wiring
• scientific article; zbMATH DE number 1981016

Cites work

• Embedding ladders and caterpillars into the hypercube
• scientific article; zbMATH DE number 4147467 (Why is no real title available?)
• scientific article; zbMATH DE number 52113 (Why is no real title available?)

Cited in

(2)

• Compression of dynamic graphs generated by a duplication model
• Physical expander in virtual tree overlay

This page was built for publication: Compression and expansion in graphs using overlays

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