Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, Peter Stumpf
{"title":"Level Planarity Is More Difficult Than We Thought","authors":"Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, Peter Stumpf","doi":"arxiv-2409.01727","DOIUrl":null,"url":null,"abstract":"We consider three simple quadratic time algorithms for the problem Level\nPlanarity and give a level-planar instance that they either falsely report as\nnegative or for which they output a drawing that is not level planar.","PeriodicalId":501216,"journal":{"name":"arXiv - CS - Discrete Mathematics","volume":"73 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.01727","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We consider three simple quadratic time algorithms for the problem Level
Planarity and give a level-planar instance that they either falsely report as
negative or for which they output a drawing that is not level planar.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
