Author:
Brandes Ulrik,Cornelsen Sabine,Fieß Christian,Wagner Dorothea
Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference26 articles.
1. Sketch-driven orthogonal graph drawing;Brandes,2002
2. Interactive giotto: An algorithm for interactive orthogonal graph drawing;Bridgeman,1998
3. S. Cornelsen, D. Wagner, Completely connected clustered graphs, in: Proceedings of the 29th International Workshop on Graph Theoretic Concepts in Computer Science (WG 2003), submitted for publication
4. A linear time algorithm to recognize clustered planar graphs and its parallelization;Dahlhaus,1998
5. On the structure of a family of minimal weighted cuts in a graph;Dinitz,1976
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献