Cover Image

The trace reconstruction problem for spider graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Sun, Alec, Yue, William
Format:	Preprint
Published:	2022
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Faster algorithms for packing forests in graphs and related problems
by: Arkhipov, Pavel, et al.
Published: (2024)

Fixed-magnetization Ising on random graphs up to reconstruction
by: Gheissari, Reza, et al.
Published: (2025)

To buy or not to buy: deterministic rent-or-buy problems on node-weighted graphs
by: Borst, Sander, et al.
Published: (2025)

Lower bounds for graph reconstruction with maximal independent set queries
by: Michel, Lukas, et al.
Published: (2024)

Pre-assignment problem for unique minimum vertex cover on bounded clique-width graphs
by: An, Shinwoo, et al.
Published: (2024)

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

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)

Solving the all pairs shortest path problem after minor update of a large dense graph
by: Liu, Gangli
Published: (2024)

Selection Improvements on the Parallel Iterative Algorithm for Stable Matching
by: Wynn, Scott, et al.
Published: (2024)

On 2-strong connectivity orientations of mixed graphs and related problems
by: Georgiadis, Loukas, et al.
Published: (2023)

A QPTAS for Facility Location on Unit Disk graphs
by: Friggstad, Zachary, et al.
Published: (2024)

Continuous optimization methods for the graph isomorphism problem
by: Klus, Stefan, et al.
Published: (2023)

Dynamic parameterized problems on unit disk graphs
by: An, Shinwoo, et al.
Published: (2024)

Trace reconstruction from local statistical queries
by: Chen, Xi, et al.
Published: (2024)

Beyond a Single Queue: Multi-Level-Multi-Queue as an Effective Design for SSSP problems on GPUs
by: Hu, Zhengding, et al.
Published: (2026)

Self-referential instances of the dominating set problem are irreducible
by: Zhou, Guangyan
Published: (2026)

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

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

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)

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

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

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)

Quasi-linear distance query reconstruction for graphs of bounded treelength
by: Bastide, Paul, et al.
Published: (2024)

On the closest pair of points problem
by: Hitz, Martin, et al.
Published: (2026)

A fine-grained dichotomy for the center problem on Gromov hyperbolic graphs
by: Ducoffe, Guillaume
Published: (2026)

On the non-submodularity of the problem of adding links to minimize the effective graph resistance
by: Achterberg, Massimo A., et al.
Published: (2025)

Testing $C_k$-freeness in bounded-arboricity graphs
by: Eden, Talya, et al.
Published: (2024)

An FPRAS for two terminal reliability in directed acyclic graphs
by: Feng, Weiming, et al.
Published: (2023)

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

The Leafed Induced Subtree in chordal and bounded treewidth graphs
by: Baste, Julien
Published: (2023)

Simple and efficient four-cycle counting on sparse graphs
by: Burkhardt, Paul, et al.
Published: (2023)

Exact recovery of planted cliques in semi-random graphs
by: Khanna, Yash
Published: (2020)

Dynamic framework for edge-connectivity maintenance of simple graphs
by: Wrobel, Blazej
Published: (2026)