Degree Programs
List of Courses
ICS Web Pages
The ICS website
conforms to
the W3C
XHTML 1.0 Transitional
Standard Encoding
Search
Upcoming events
- Solving Different Problems Simultaneously with Artificial Chemistry(seminar)(23 days)
Open Access Journals in Computer Science
Navigation
A Linear Algorithm for Bipartite Drawing with Minimum Edge Crossings of Complete Binary Trees
Published in Abstracts | ICS Research
E.A. ALBACEA. 2006. Philippine Computing Journal 1(1): 1-5.
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.
Keywords: Bipartite drawing, bipartite crossing number, graph drawing, complete binary tree.
Suggested citation for this online article:
_______. A Linear Algorithm For Bipartite Drawing With Minimum Edge Crossings Of Complete Binary Trees. Accessed 21 November 2008. UPLB-ICS webpage (http://www.ics.uplb.edu.ph/node/104).