Abstract
For a simple undirected graph with n vertices and m edges, we consider a data structure that given a query of a pair of vertices u, v and an integer k≥1, it returns k edge-disjoint uv-paths. The data structure takes Õ(n3.375) time to build, using O(mn1.5logn) space, and each query takes O(kn) time, which is optimal and beats the previous query time of O(knα(n)).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
