We present a preprocessor for the spring embedder graph drawing method and show its use in speeding up the automatic layout of three-dimensional visualizations of WWW sites. Sprin...
—Maze routing algorithms are widely used for finding an optimal path in detailed routing for very large scale integration, printed circuit board and multichip modules In this pap...
The bigraph crossing problem, embedding the two node sets of a bipartite graph G = V0;V1;E along two parallel lines so that edge crossings are minimized, has application to placeme...
Matthias F. M. Stallmann, Franc Brglez, Debabrata ...
Real-world social networks from a variety of domains can naturally be modelled as dynamic graphs. However, approaches to detecting communities have largely focused on identifying ...
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...