Reproduce “Temporal Exploration and Rendezvous via Weisfeiler-Leman Colorings” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Frank Kammer, Sandra Kiefer, Johannes Meintrup

The authors construct a deterministic polynomial-time walk that visits every vertex of a connected temporal graph in O(qn log^3 n) time steps, assuming every snapshot is connected and the graph lasts sufficiently long. Here q counts vertex classes from stable 2-WL coloring and is at most the number of automorphism orbits. For constant q, the lower bound Ω(n log n) leaves an O(log^2 n) gap.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.