Foremost non-stop journey arrival in linear time

DOI10.1007/978-3-031-09993-9_16OpenAlexW4285228787MaRDI QIDQ2097355

Binh-Minh Bui-Xuan, Juan Villacis-Llobet, Maria Gradinariu Potop-Butucaru

Publication date: 11 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-09993-9_16

zbMATH Keywords

temporal graphforemost journeynon-stop journey

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Cites Work

• Unnamed Item
• A linear-time algorithm for a special case of disjoint set union
• Finding temporal paths under waiting time constraints
• Towards classifying the polynomial-time solvability of temporal betweenness centrality
• Shortest, Fastest, and Foremost Broadcast in Dynamic Networks
• Connection Scan Algorithm
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS

This page was built for publication: Foremost non-stop journey arrival in linear time