搜索筛选:
搜索耗时7.0271秒,为你在为你在102,285,761篇论文里面共找到 2 篇相符的论文内容
发布年度:
Social Choice Meets Graph Drawing: How to Get Subexponential Time Algorithms for Ranking and Drawing
[期刊论文] 作者：Henning Fernau,Fedor V.Fomin,D,
来源：黑龙江科技学院学报 年份：2014
为探究吕家坨井田地质构造格局,根据钻孔勘探资料,采用分形理论和趋势面分析方法,研究了井田7...
Social Choice Meets Graph Drawing: How to Get Subexponential Time Algorithms for Ranking and Drawing
[期刊论文] 作者：Henning Fernau,Fedor V.Fomin,Daniel Lokshtanov,Matthias Mnich,Geevarghese Philip,Saket Saurabh,,
来源：Tsinghua Science and Technology 年份：2014
We analyze a common feature of p-Kemeny AGGregation(p-KAGG) and p-One-Sided Crossing Minimization(p-OSCM) to provide new insights and findings of interest to both the graph drawing community and the s...
相关搜索：
