Distance-Preserving Subgraphs of Interval Graphs.
european symposium on algorithms(2017)
摘要
We consider the problem of finding small distance-preserving subgraphs of undirected, unweighted interval graphs that have k terminal vertices. We show that every interval graph admits a distance-preserving subgraph with O(k log k) branching vertices. We also prove a matching lower bound by exhibiting an interval graph based on bit-reversal permutation matrices. In addition, we show that interval graphs admit subgraphs with O(k) branching vertices that approximate distances up to an additive term of +1.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络