An O(nlogn) algorithm for redrawing a tree into a bipartite graph with minimum edge crossing

Author

Neila Maquiling Paglinawan

Date

2003

Document Type

Master Thesis

Language

English

Location

UPLB Main Library Special Collections Section (USCS)

Call Number

LG 995 2003 C65 P34

Recommended Citation

Paglinawan, Neila Maquiling, "An O(nlogn) algorithm for redrawing a tree into a bipartite graph with minimum edge crossing" (2003). Graduate Student's Output. 1088.
https://www.ukdr.uplb.edu.ph/etd-grad/1088