Computing Vertex-Disjoint Paths using MAOs
Discrete Mathematics
2016-09-22 v1 Data Structures and Algorithms
Abstract
Let G be a graph with minimum degree . It is well-known that maximal adjacency orderings (MAOs) compute a vertex set S such that every pair of S is connected by at least internally vertex-disjoint paths in G. We present an algorithm that, given any pair of S, computes these paths in linear time O(n+m). This improves the previously best solutions for these special vertex pairs, which were flow-based. Our algorithm simplifies a proof about pendant pairs of Mader and makes a purely existential proof of Nagamochi algorithmic.
Cite
@article{arxiv.1609.06522,
title = {Computing Vertex-Disjoint Paths using MAOs},
author = {Johanna E. Preißer and Jens M. Schmidt},
journal= {arXiv preprint arXiv:1609.06522},
year = {2016}
}