Copertina

Restless reachability problems in temporal graphs

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Thejaswi, Suhas, Lauri, Juho, Gionis, Aristides
Natura:	Preprint
Pubblicazione:	2020
Soggetti:	Data Structures and Algorithms Distributed, Parallel, and Cluster Computing F.2.2; G.4; F.2.1
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

On the Node-Averaged Complexity of Locally Checkable Problems on Trees
di: Balliu, Alkida, et al.
Pubblicazione: (2023)

Boolean Matrix Multiplication for Highly Clustered Data on the Congested Clique
di: Lingas, Andrzej
Pubblicazione: (2024)

Fast Gossip-based Rumor Spreading using Small Messages
di: Dufoulon, Fabien, et al.
Pubblicazione: (2026)

Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs
di: Faour, Salwa, et al.
Pubblicazione: (2025)

Decentralized Distributed Graph Coloring: Cluster Graphs
di: Flin, Maxime, et al.
Pubblicazione: (2024)

Deterministic Fault-Tolerant Local Load Balancing and its Applications against Adaptive Adversaries
di: Kowalski, Dariusz R., et al.
Pubblicazione: (2025)

High-Quality Multi-Constraint Hypergraph Partitioning via Greedy Rebalancing
di: Maas, Nikolai
Pubblicazione: (2026)

Low-Depth Spatial Tree Algorithms
di: Baumann, Yves, et al.
Pubblicazione: (2024)

RadiK: Scalable and Optimized GPU-Parallel Radix Top-K Selection
di: Li, Yifei, et al.
Pubblicazione: (2025)

On Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds in the MPC Model
di: Lingas, Andrzej
Pubblicazione: (2026)

On the Computation of 2-Dimensional Recurrence Equations
di: Natale, Giuseppe
Pubblicazione: (2024)

The World's Fastest Matching Engine Algorithm
di: Yoon, Jake
Pubblicazione: (2026)

Reducing Matroid Optimization to Basis Search
di: Streit, Robert, et al.
Pubblicazione: (2024)

Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity
di: Gupta, Chetan, et al.
Pubblicazione: (2024)

Splittable Spanning Trees and Balanced Forests in Dense Random Graphs
di: Gillman, David, et al.
Pubblicazione: (2025)

The Constrained Layer Tree Problem and Applications to Solar Farm Cabling
di: Bläsius, Thomas, et al.
Pubblicazione: (2024)

Beating Meet-in-the-Middle for Subset Balancing Problems
di: Randolph, Tim, et al.
Pubblicazione: (2025)

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
di: Randolph, Tim, et al.
Pubblicazione: (2024)

Unsplittable Multicommodity Flows in Outerplanar Graphs
di: Alemán-Espinosa, David, et al.
Pubblicazione: (2025)

A Tight Meta-theorem for LOCAL Certification of MSO$_2$ Properties within Bounded Treewidth Graphs
di: Cook, Linda, et al.
Pubblicazione: (2025)

When Votes Change and Committees Should (Not)
di: Bredereck, Robert, et al.
Pubblicazione: (2020)

Min cost flow on unit capacity networks and convex cost K-flow are as easy as the assignment problem with All-Min-Cuts algorithm
di: Hochbaum, Dorit S.
Pubblicazione: (2016)

Min-CSPs on Complete Instances
di: Anand, Aditya, et al.
Pubblicazione: (2024)

Clock Synchronization Is Almost Impossible with Bounded Memory
di: Charron-Bost, Bernadette, et al.
Pubblicazione: (2024)

Generating Signed Permutations by Twisting Two-Sided Ribbons
di: Yuan, et al.
Pubblicazione: (2023)

Efficient Uniform Sampling of Surjections via their Profiles
di: Carayol, Arnaud, et al.
Pubblicazione: (2026)

Scalable overset computation between a forest-of-octrees- and an arbitrary distributed parallel mesh
di: Brandt, Hannes, et al.
Pubblicazione: (2026)

Realizing temporal graphs from fastest travel times
di: Klobas, Nina, et al.
Pubblicazione: (2023)

Simple Symmetric Sustainable Sorting -- the greeNsort article
di: Oehlschlägel, Jens
Pubblicazione: (2024)

Low-degree spanning trees of $2$-edge-connected graphs in linear time
di: Dereniowski, Dariusz, et al.
Pubblicazione: (2024)

Weisfeiler-Leman on graphs of small twin-width
di: Heinrich, Irene, et al.
Pubblicazione: (2026)

A Note on Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds of the Congested Clique
di: Lingas, Andrzej
Pubblicazione: (2024)

Stabilizing Consensus is Impossible in Lossy Iterated Immediate Snapshot Models
di: Felber, Stephan, et al.
Pubblicazione: (2024)

A Heuristic for Direct Product Graph Decomposition
di: Calderoni, Luca, et al.
Pubblicazione: (2021)

Eliminating Illusion in Directed Networks
di: Jana, Sougata, et al.
Pubblicazione: (2026)

Arrow Matrix Decomposition: A Novel Approach for Communication-Efficient Sparse Matrix Multiplication
di: Gianinazzi, Lukas, et al.
Pubblicazione: (2024)

Topology-Based Reconstruction Prevention for Decentralised Learning
di: Dekker, Florine W., et al.
Pubblicazione: (2023)

Mathematical Foundations for Peer-to-Peer Lattice Computation
di: Gorinevski, Danil
Pubblicazione: (2026)

Exploration of $k$-edge-deficient temporal graphs in linear time
di: Lahtin, Ivan, et al.
Pubblicazione: (2026)

Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs
di: Balzotti, Lorenzo
Pubblicazione: (2020)