Asymptotic connectedness of random interval graphs in a one dimensional data delivery problem

DOI10.1007/978-3-030-85325-9_1zbMath1496.68261OpenAlexW3213505791MaRDI QIDQ2080161

Paulo Cesar Manrique Mirón, Erick Treviño Aguilar, Gilberto Calvillo, Caleb Erubiel Andrade Sernas

Publication date: 7 October 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-85325-9_1

zbMATH Keywords

mobile agentsconnectedness analysisdata delivery problemrandom interval graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62) Agent technology and artificial intelligence (68T42) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lectures on the nearest neighbor method
• An evolution of interval graphs
• The asymptotic probability that a random graph is a unit interval graph, indifference graph, or proper interval graph
• Data delivery by energy-constrained mobile agents
• Collecting Information by Power-Aware Mobile Agents
• Reducibility among Combinatorial Problems
• Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots
• Data Delivery by Energy-Constrained Mobile Agents on a Line
• Computational Complexity
• Paths, Trees, and Flowers
• Random Graphs
• The complexity of theorem-proving procedures

This page was built for publication: Asymptotic connectedness of random interval graphs in a one dimensional data delivery problem