Sciweavers

1163 search results - page 187 / 233
» Embedding into Bipartite Graphs
Sort
View
SAMOS
2004
Springer
14 years 1 months ago
High-Speed Event-Driven RTL Compiled Simulation
In this paper we present a new approach for generating high-speed optimized event-driven register transfer level (RTL) compiled simulators. The generation of the simulators is part...
Alexey Kupriyanov, Frank Hannig, Jürgen Teich
IV
2002
IEEE
130views Visualization» more  IV 2002»
14 years 1 months ago
Spring Embedder Preprocessing for WWW Visualization
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...
Paul Mutton, Peter Rodgers
ISPD
1999
ACM
89views Hardware» more  ISPD 1999»
14 years 20 days ago
VIA design rule consideration in multi-layer maze routing algorithms
—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...
Jason Cong, Jie Fang, Kei-Yong Khoo
ASUNAM
2010
IEEE
13 years 10 months ago
Tracking the Evolution of Communities in Dynamic Social Networks
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 ...
Derek Greene, Dónal Doyle, Padraig Cunningh...
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 8 months ago
Complexity dichotomy on partial grid recognition
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...
Vinícius G. P. de Sá, Guilherme Dias...