Effective storage capacity of labeled graphs
From MaRDI portal
Publication:2637317
DOI10.1016/j.ic.2013.11.004zbMath1282.68179MaRDI QIDQ2637317
Goran Konjevod, James Aspnes, Jiang Chen, Dana Angluin, Rida A. Bazzi, David Eisenstat
Publication date: 11 February 2014
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2013.11.004
05C35: Extremal problems in graph theory
68R10: Graph theory (including graph drawing) in computer science
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
68P20: Information storage and retrieval of data
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the asymptotic and computational complexity of graph distinguishability
- Symmetry breaking in graphs
- Computation in networks of passively mobile finite-state sensors
- Storage Modification Machines
- Self-stabilizing systems in spite of distributed control
- Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
- Distinguishing Cartesian powers of graphs