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
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
