On Crossing Sets, Disjoint Sets, and Pag
โ
Farhad Shahrokhi; Weiping Shi
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 109 KB
Let G s V, E be a t-partite graph with n vertices and m edges, where the ลฝ 2 1.5 . partite sets are given. We present an O n m time algorithm to construct drawings of G in the plane so that the size of the largest set of pairwise crossing ลฝ edges and, at the same time, the size of the largest set of