Sequences of Radius k for Complete Bipartite Graphs

DOI10.1007/978-3-662-53536-3_1zbMath1417.05047OpenAlexW2963053721MaRDI QIDQ3181042

Michał Dębski, Paweł Rzążewski, Zbigniew Lonc

Publication date: 22 December 2016

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53536-3_1

Mathematics Subject Classification ID

Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Sequences of radius \(k\) for complete bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The existence of \(k\)-radius sequences
• Constructions of asymptotically shortest \(k\)-radius sequences
• Sequences of large radius
• Near perfect coverings in graphs and hypergraphs
• The edge Hamiltonian path problem is NP-complete
• Constructing 𝑘-radius sequences
• Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
• The bandwidth problem for graphs and matrices—a survey
• Complexity Results for Bandwidth Minimization
• Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations

This page was built for publication: Sequences of Radius k for Complete Bipartite Graphs