{"title":"完全二叉树最小边交叉的线性二部图算法","authors":"E. Albacea","doi":"10.3860/PCJ.V1I1.196","DOIUrl":null,"url":null,"abstract":"In this paper, we present a simple linear algorithm for bipartite drawing with minimum edge crossings of complete binary trees. Also obtained with the drawing algorithm is the formula for computing the bipartite crossing numbers of complete binary trees. Philippine Computing Journal 1(1) 2006 1-5","PeriodicalId":391026,"journal":{"name":"Philippine Computing Journal","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Linear Algorithm for Bipartite Drawing with Minimum Edge Crossings of Complete Binary Trees\",\"authors\":\"E. Albacea\",\"doi\":\"10.3860/PCJ.V1I1.196\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a simple linear algorithm for bipartite drawing with minimum edge crossings of complete binary trees. Also obtained with the drawing algorithm is the formula for computing the bipartite crossing numbers of complete binary trees. Philippine Computing Journal 1(1) 2006 1-5\",\"PeriodicalId\":391026,\"journal\":{\"name\":\"Philippine Computing Journal\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-05-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Philippine Computing Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3860/PCJ.V1I1.196\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Philippine Computing Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3860/PCJ.V1I1.196","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Linear Algorithm for Bipartite Drawing with Minimum Edge Crossings of Complete Binary Trees
In this paper, we present a simple linear algorithm for bipartite drawing with minimum edge crossings of complete binary trees. Also obtained with the drawing algorithm is the formula for computing the bipartite crossing numbers of complete binary trees. Philippine Computing Journal 1(1) 2006 1-5
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
