交叉最小化满足同时绘图

2008 IEEE Pacific Visualization Symposium Pub Date : 2008-03-05 DOI:10.1109/PACIFICVIS.2008.4475456

Markus Chimani, M. Jünger, Michael Schulz

{"title":"交叉最小化满足同时绘图","authors":"Markus Chimani, M. Jünger, Michael Schulz","doi":"10.1109/PACIFICVIS.2008.4475456","DOIUrl":null,"url":null,"abstract":"We define the concept of crossing numbers for simultaneous graphs by extending the crossing number problem of traditional graphs. We discuss differences to the traditional crossing number problem, and give an NP-completeness proof and lower and upper bounds for the new problem. Furthermore, we show how existing heuristic and exact algorithms for the traditional problem can be adapted to the new task of simultaneous crossing minimization, and report on a brief experimental study of their implementations.","PeriodicalId":364669,"journal":{"name":"2008 IEEE Pacific Visualization Symposium","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2008-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":"{\"title\":\"Crossing Minimization meets Simultaneous Drawing\",\"authors\":\"Markus Chimani, M. Jünger, Michael Schulz\",\"doi\":\"10.1109/PACIFICVIS.2008.4475456\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We define the concept of crossing numbers for simultaneous graphs by extending the crossing number problem of traditional graphs. We discuss differences to the traditional crossing number problem, and give an NP-completeness proof and lower and upper bounds for the new problem. Furthermore, we show how existing heuristic and exact algorithms for the traditional problem can be adapted to the new task of simultaneous crossing minimization, and report on a brief experimental study of their implementations.\",\"PeriodicalId\":364669,\"journal\":{\"name\":\"2008 IEEE Pacific Visualization Symposium\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-03-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"25\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE Pacific Visualization Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PACIFICVIS.2008.4475456\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE Pacific Visualization Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACIFICVIS.2008.4475456","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 25

摘要

通过推广传统图的相交数问题，定义了同时图的相交数概念。讨论了与传统交叉数问题的区别，给出了新问题的np -完备性证明和下界和上界。此外，我们展示了传统问题的现有启发式和精确算法如何适用于同时交叉最小化的新任务，并报告了它们实现的简短实验研究。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Crossing Minimization meets Simultaneous Drawing

We define the concept of crossing numbers for simultaneous graphs by extending the crossing number problem of traditional graphs. We discuss differences to the traditional crossing number problem, and give an NP-completeness proof and lower and upper bounds for the new problem. Furthermore, we show how existing heuristic and exact algorithms for the traditional problem can be adapted to the new task of simultaneous crossing minimization, and report on a brief experimental study of their implementations.

求助全文

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

来源期刊

2008 IEEE Pacific Visualization Symposium

自引率

0.00%

发文量