Cover Image

Distributed computation of temporal twins in periodic undirected time-varying graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Azerouk, Lina, Bui-Xuan, Binh-Minh, Palisoc, Camille, Potop-Butucaru, Maria, Tighilt, Massinissa
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Model checking with temporal graphs and their derivative
by: Bui-Xuan, Binh-Minh, et al.
Published: (2026)

The Price of Universal Temporal Reachability
by: Bui-Xuan, Binh-Minh, et al.
Published: (2026)

Improved girth approximation in weighted undirected graphs
by: Kadria, Avi, et al.
Published: (2025)

On the power of standard DFS and BFS
by: Bui-Xuan, Binh-Minh, et al.
Published: (2026)

An efficient implementation for solving the all pairs minimax path problem in an undirected dense graph
by: Liu, Gangli
Published: (2024)

Quantum algorithms and lower bounds for eccentricity, radius, and diameter in undirected graphs
by: Wesołowski, Adam, et al.
Published: (2025)

An efficient recursive decomposition algorithm for undirected graphs
by: Heng, Pei, et al.
Published: (2026)

Quasilinear-time eccentricities computation, and more, on median graphs
by: Bergé, Pierre, et al.
Published: (2024)

Improved exploration of temporal graphs
by: Bastide, Paul, et al.
Published: (2025)

Dynamic data structures for twin-ordered matrices
by: Bosek, Bartłomiej, et al.
Published: (2026)

The problem of computing a $2$-T-connected spanning subgraph with minimum number of edges in directed graphs
by: Jaberi, Raed, et al.
Published: (2024)

Faster diameter computation in graphs of bounded Euler genus
by: Kluk, Kacper, et al.
Published: (2025)

Edge-coloring sparse graphs with $Δ$ colors in quasilinear time
by: Kowalik, Lukasz
Published: (2024)

Computing Time-varying Network Reliability using Binary Decision Diagrams
by: Nakahata, Yu, et al.
Published: (2025)

DTC: Real-Time and Accurate Distributed Triangle Counting in Fully Dynamic Graph Streams
by: Xuan, Wei, et al.
Published: (2025)

Realizing temporal transportation trees
by: Mertzios, George B., et al.
Published: (2024)

Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation
by: Hatzel, Meike, et al.
Published: (2022)

Temporal queries for dynamic temporal forests
by: Bilò, Davide, et al.
Published: (2024)

Locally computing edge orientations
by: Mitrović, Slobodan, et al.
Published: (2025)

Streaming periodicity with mismatches, wildcards, and edits
by: Ghazi, Taha El, et al.
Published: (2025)

A characterization of one-sided error testable graph properties in bounded degeneracy graphs
by: Lachish, Oded, et al.
Published: (2026)

Faster feasibility for dynamic flows and transshipments on temporal networks
by: Sheridan, Kristin, et al.
Published: (2024)

Meeting times on graphs in near-cubic time
by: McAvoy, Alex
Published: (2026)

Differentially private graph coloring
by: Xie, Michael, et al.
Published: (2026)

Designing sparse temporal graphs satisfying connectivity requirements
by: Bellitto, Thomas, et al.
Published: (2026)

The trace reconstruction problem for spider graphs
by: Sun, Alec, et al.
Published: (2022)

The Canadian Traveller Problem on outerplanar graphs
by: Beaudou, Laurent, et al.
Published: (2024)

Private graph colouring with limited defectiveness
by: Christiansen, Aleksander B. G., et al.
Published: (2024)

Practical algorithms for Hierarchical overlap graphs
by: Talera, Saumya, et al.
Published: (2024)

Efficient algorithms for computing bisimulations for nondeterministic fuzzy transition systems
by: Nguyen, Linh Anh
Published: (2024)

A computational study of Gomory-Hu construction tree algorithms
by: Kolmogorov, Vladimir
Published: (2022)

Parameterized Algorithms for Computing MAD Trees
by: Breitkopf, Tom-Lukas, et al.
Published: (2026)

Spanning tree congestion of proper interval graphs
by: Otachi, Yota
Published: (2026)

Approximating optimization problems in graphs with locational uncertainty
by: Bougeret, Marin, et al.
Published: (2022)

Fair densest subgraph across multiple graphs
by: Arachchi, Chamalee Wickrama, et al.
Published: (2025)

On $k$-connectivity oracles in $k$-connected graphs
by: Nutov, Zeev
Published: (2026)

Upper bounds on the theta function of random graphs
by: Feige, Uriel, et al.
Published: (2025)

On recognizing graphs representing Persistent Perfect Phylogenies
by: Bonizzoni, Paola, et al.
Published: (2025)

Strassen's algorithm via orbit flip graphs
by: Ikenmeyer, Christian, et al.
Published: (2025)

OrderedCuts: A new approach for computing Gomory-Hu tree
by: Kolmogorov, Vladimir
Published: (2022)