{"title":"平面图的研究现状","authors":"M. Rahman","doi":"10.1109/ICICT.2007.375362","DOIUrl":null,"url":null,"abstract":"A graph consists of a set of vertices and a set of edges, each joining two vertices. A graph is planar if it can be embedded in the plane so that no two edges intersect geometrically except at a vertex to which they are both incident. A plane graph is a planar graph with a fixed embedding. Planar graphs have attracted computer scientists' interest due to their enormous applications, and a lot of interesting algorithms and complexity results have been obtained for planar graphs. In this talk we survey the results on planar graphs.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Current Research on Planar Graphs\",\"authors\":\"M. Rahman\",\"doi\":\"10.1109/ICICT.2007.375362\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A graph consists of a set of vertices and a set of edges, each joining two vertices. A graph is planar if it can be embedded in the plane so that no two edges intersect geometrically except at a vertex to which they are both incident. A plane graph is a planar graph with a fixed embedding. Planar graphs have attracted computer scientists' interest due to their enormous applications, and a lot of interesting algorithms and complexity results have been obtained for planar graphs. In this talk we survey the results on planar graphs.\",\"PeriodicalId\":206443,\"journal\":{\"name\":\"2007 International Conference on Information and Communication Technology\",\"volume\":\"56 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-03-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Information and Communication Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICT.2007.375362\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Information and Communication Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICT.2007.375362","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A graph consists of a set of vertices and a set of edges, each joining two vertices. A graph is planar if it can be embedded in the plane so that no two edges intersect geometrically except at a vertex to which they are both incident. A plane graph is a planar graph with a fixed embedding. Planar graphs have attracted computer scientists' interest due to their enormous applications, and a lot of interesting algorithms and complexity results have been obtained for planar graphs. In this talk we survey the results on planar graphs.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
