What type of study is this?

This is a Experimental Study study.

October 19, 2025Open Access

Maintaining Routing Structures under Deletions via Self-Pruning

View Full Paper

Ask AI

Bookmark

Authors

This work tackles routing and pruning in expander graphs, ensuring low-congestion flow and stability under edge failures.

The proposed approach ensures efficient routing under unit multi-commodity demand, maintaining low congestion.
An algorithm is developed for self-pruning in expander graphs, controlling adverse effects of edge deletions.
This new methodology allows tight control over routing path lengths, balancing trade-offs in congestion and pruning.
The guarantees extend to cases requiring constant-hop and length-constrained routing, enhancing routing efficiency.

Haeupler et al. (2025) studied this question.

View Full Paper

Ask AI

Bookmark