《Social Choice Meets Graph Drawing How to Get Subexponential Time Algorithms for Ranking and Drawing Problems》.pdfVIP

  • 10
  • 0
  • 约10.77万字
  • 约 13页
  • 2015-11-24 发布于浙江
  • 举报

《Social Choice Meets Graph Drawing How to Get Subexponential Time Algorithms for Ranking and Drawing Problems》.pdf

TSINGHUASCIENCEANDTECHNOLOGY ISSN1007-021406/08 pp374-386 Volume 2014 19,Number4,August Social ChoiceMeets toGet GraphDrawing:How Time for and Problems AlgorithmsRankingDrawing HenningFernau+,Fedorv.FOmin,DanielLokshtanov, Matthias SaketSaurabh Mnich,GeevarghesePhilip,and Abstract:Weacommonfeature analyz

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档