S.NAKAYAMA, S.MASUYAMA: "An O(n^3) time algorithm for obtaining the minimum vertex ranking spanning tree on interval graphs"The 3rd Hungarian-Japanese Symposium on Discrete Mathmatics and Its Applications. 1. 283-292 (2003)
S.NAKAYAMA, S.MASUYAMA: "An O(n^3) time algorithm for obtaining the minimum vertex ranking spanning tree on interval graphs"The 3rd Hungarian-Japanese Symposium on Discrete Mathmatics and Its Applications. 1. 283-292 (2003)
复制标题
S.NAKAYAMA、S.MASUYAMA：“An O(n^3) time Algorithm for getting the Minimum vertexRanking spanning Tree on Interval Graphics”第三届匈牙利-日本离散数学及其应用研讨会。
DOI：
--
复制
发表时间：
--
期刊：
影响因子：
--
通讯作者：
中科院分区：
文献类型：
--
作者：
