3 papers
cs.DS2001
Common-Face Embeddings of Planar Graphs
Zhi-Zhong Chen, Xin He, Ming-Yang Kao
Given a planar graph G and a sequence C_1,...,C_q, where each C_i is a family of vertex subsets of G, we wish to find a plane embedding of G, if any exists, such that for each i in…
cs.DM1999
Map Graphs
Zhi-Zhong Chen, Michelangelo Grigni, Christos Papadimitriou
We consider a modified notion of planarity, in which two nations of a map are considered adjacent when they share any point of their boundaries (not necessarily an edge, as planari…
cs.DS1999
Reducing Randomness via Irrational Numbers
Zhi-Zhong Chen, Ming-Yang Kao
We propose a general methodology for testing whether a given polynomial with integer coefficients is identically zero. The methodology evaluates the polynomial at efficiently compu…