Theoretical Computer Science
Curve-constrained drawings of planar graphs
Computational Geometry: Theory and Applications
Visual Analysis Tool for Bipartite Networks
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II
Anchored Map: Graph Drawing Technique to Support Network Mining
IEICE - Transactions on Information and Systems
Sphere Anchored Map: A Visualization Technique for Bipartite Graphs in 3D
Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques
Hi-index | 0.00 |
Let G be a bipartite graph, and let λe, λi be two parallel convex curves; we study the question about whether G admits a planar straight line drawing such that the vertices of one partite set of G lie on λe and the vertices of the other partite set lie on λi. A characterization is presented that gives rise to linear time testing and drawing algorithms.