水平平面性比我们想象的更困难

arXiv - CS - Discrete Mathematics Pub Date : 2024-09-03 DOI:arxiv-2409.01727

Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, Peter Stumpf

{"title":"水平平面性比我们想象的更困难","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":"{\"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}","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

摘要

我们考虑了水平平面性问题的三种简单二次方时间算法，并给出了一个水平平面性实例，这些算法要么误报为负值，要么输出的图纸不是水平平面性的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Level Planarity Is More Difficult Than We Thought

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

arXiv - CS - Discrete Mathematics

自引率

0.00%

发文量