691 search results - page 97 / 139 » Non-negative graph embedding |
IV
2002
IEEE
14 years 1 months ago
2002
IEEE
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...
ISPD
1999
ACM
14 years 13 days ago
1999
ACM
—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...
ISCAS
1999
IEEE
14 years 12 days ago
1999
IEEE
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...
ASUNAM
2010
IEEE
13 years 9 months ago
2010
IEEE
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 ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
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...