COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
From MaRDI portal
Publication:5696908
DOI10.1142/S0129054103001728zbMath1075.68545MaRDI QIDQ5696908
No author found.
Publication date: 19 October 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
routing; dynamic networks; graph theoretical models; evolving graphs; fixed-schedule dynamic networks; leo satellite networks
68M10: Network design and communication in computer systems
Related Items
Modeling tripartite entanglement in quantum protocols using evolving entangled hypergraphs, Unnamed Item, PERFORMANCE ANALYSIS AND EVALUATION OF RANDOM WALK ALGORITHMS ON WIRELESS NETWORKS, Unnamed Item, Unnamed Item, Convergecast Tree on Temporal Graphs, Edge-Disjoint Branchings in Temporal Graphs, On Verifying and Maintaining Connectivity of Interval Temporal Networks, Non-strict Temporal Exploration, Temporal Vertex Cover with a Sliding Time Window, Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems, Temporal Cliques Admit Sparse Spanners, Information Spreading in Dynamic Networks: An Analytical Approach, Exploration of \(k\)-edge-deficient temporal graphs, Exploration of \(k\)-edge-deficient temporal graphs, Temporal graph classes: a view through temporal separators, Self-stabilizing robots in highly dynamic environments, The temporal explorer who returns to the base, Edge exploration of temporal graphs, On finding separators in temporal split and permutation graphs, Edge exploration of temporal graphs, On finding separators in temporal split and permutation graphs, An Introduction to Temporal Graphs: An Algorithmic Perspective*, Shortest Journeys in Directed Temporal Graphs, Mengerian graphs: characterization and recognition, A study of connectivity on dynamic graphs: computing persistent connected components, Self-stabilizing systems in spite of high dynamics, Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality, Computing Betweenness Centrality in Link Streams, Simple, strict, proper, happy: a study of reachability in temporal graphs, Blackout-tolerant temporal spanners, Sharp Thresholds in Random Simple Temporal Graphs, Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs, Finding Temporal Paths Under Waiting Time Constraints., Traveling salesman problems in temporal graphs, Mining preserving structures in a graph sequence, Searching for black holes in subways, On the treewidth of dynamic graphs, Temporal network optimization subject to connectivity constraints, Finding temporal paths under waiting time constraints, Computing parameters of sequence-based dynamic graphs, Temporal vertex cover with a sliding time window, Consensus in rooted dynamic networks with short-lived stability, Sliding window temporal graph coloring, Temporal cliques admit sparse spanners, Foremost non-stop journey arrival in linear time, Mengerian temporal graphs revisited, Maximum 0-1 timed matching on temporal graphs, Distributed exploration of dynamic rings, How fast can we reach a target vertex in stochastic temporal graphs?, Using compressed suffix-arrays for a compact representation of temporal-graphs, On short fastest paths in temporal graphs, Edge-disjoint branchings in temporal digraphs, Coloring temporal graphs, On the expressivity of time-varying graphs, The complexity of optimal design of temporally connected graphs, On computing Pareto optimal paths in weighted time-dependent networks, On temporal graph exploration, Deleting edges to restrict the size of an epidemic in temporal networks, A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs, Towards classifying the polynomial-time solvability of temporal betweenness centrality, Temporal matching on geometric graph data, Parameterised temporal exploration problems, Efficiently Testing $$T$$-Interval Connectivity in Dynamic Graphs, Shortest, Fastest, and Foremost Broadcast in Dynamic Networks, An Introduction to Temporal Graphs: An Algorithmic Perspective
Cites Work
