{"title":"A note on the complexity of one-sided crossing minimization of trees","authors":"Alexander Dobler","doi":"10.1016/j.ipl.2025.106575","DOIUrl":null,"url":null,"abstract":"<div><div>In 2011, Harrigan and Healy claimed that one-sided crossing minimization can be solved in polynomial time on trees <span><span>[1]</span></span>. We point out a counterexample to their claims, and show that one-sided crossing minimization is <figure><img></figure>-hard for trees.</div></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"190 ","pages":"Article 106575"},"PeriodicalIF":0.7000,"publicationDate":"2025-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing Letters","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020019025000195","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
In 2011, Harrigan and Healy claimed that one-sided crossing minimization can be solved in polynomial time on trees [1]. We point out a counterexample to their claims, and show that one-sided crossing minimization is -hard for trees.
期刊介绍：
Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered.
Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
