Publication:4527005
From MaRDI portal
zbMath0974.68011MaRDI QIDQ4527005
Publication date: 28 February 2001
68Q25: Analysis of algorithms and problem complexity
68M14: Distributed systems
68M12: Network protocols
Related Items
Fault-tolerant embedding of paths in crossed cubes, Exact communication costs for consensus and leader in a tree, Two absolute bounds for distributed bit complexity, Edge-pancyclicity and path-embeddability of bijective connection graphs