{"title":"平面图互对偶性的检验","authors":"Patrizio Angelini, Thomas Bläsius, Ignaz Rutter","doi":"10.1142/S0218195914600103","DOIUrl":null,"url":null,"abstract":"We introduce and study the problem Mutual Planar Duality, which asks for planar graphs G 1 and G 2 whether G 1 can be embedded such that its dual is isomorphic to G 2. We show NP-completeness for general graphs and give a linear-time algorithm for biconnected graphs.","PeriodicalId":285210,"journal":{"name":"International Journal of Computational Geometry and Applications","volume":"127 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Testing Mutual duality of Planar graphs\",\"authors\":\"Patrizio Angelini, Thomas Bläsius, Ignaz Rutter\",\"doi\":\"10.1142/S0218195914600103\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce and study the problem Mutual Planar Duality, which asks for planar graphs G 1 and G 2 whether G 1 can be embedded such that its dual is isomorphic to G 2. We show NP-completeness for general graphs and give a linear-time algorithm for biconnected graphs.\",\"PeriodicalId\":285210,\"journal\":{\"name\":\"International Journal of Computational Geometry and Applications\",\"volume\":\"127 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-03-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computational Geometry and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/S0218195914600103\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computational Geometry and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/S0218195914600103","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We introduce and study the problem Mutual Planar Duality, which asks for planar graphs G 1 and G 2 whether G 1 can be embedded such that its dual is isomorphic to G 2. We show NP-completeness for general graphs and give a linear-time algorithm for biconnected graphs.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
