...
机译:参数有界的图中的集合树扳手
Algorithmic Research Laboratory, Department of Computer Science, Kent State University, Kent, OH 44242, USA;
Algorithmic Research Laboratory, Department of Computer Science, Kent State University, Kent, OH 44242, USA;
spanners; tree spanners; graph distance; balanced separator; graph decomposition; tree-width; clique-width; planar graphs; c-chordal graphs; message routing; efficient algorithms;
机译:参数有界的图中的集合树扳手
机译:有界树宽图的集体加性树扳手,具有概括性和后果
机译:圆形图和多边形图的集体加法树扳手
机译:有界化和后果的有界树宽图的集体加性树扳手
机译:改进的最小-最大树覆盖,有界树覆盖,浅光和批量购买k-Steiner树以及(k,2)-子图近似算法
机译:枚举具有给定路径频率上限和下限的树状化学图
机译:有界参数图的集合树扳手