2125 search results - page 174 / 425 » On Graph Complexity |
129
click to vote
DAC
2009
ACM
15 years 6 months ago
2009
ACM
The Synchronous Dataflow (SDF) model of computation is popular for modelling the timing behaviour of real-time embedded hardware and software systems and applications. It is an es...
119
click to vote
SDM
2007
SIAM
15 years 4 months ago
2007
SIAM
The recent years have witnessed a surge of interest in graphbased semi-supervised learning methods. The common denominator of these methods is that the data are represented by the...
108
click to vote
GD
2008
Springer
15 years 4 months ago
2008
Springer
We introduce a new force-directed model for computing graph layout. The model bridges the two more popular force directed approaches – the stress and the electrical-spring models...
123
click to vote
BIOINFORMATICS
2007
15 years 3 months ago
2007
Motivation: The functioning of biological networks depends in large part on their complex underlying structure. When studying their systemic nature many modeling approaches focus ...
112
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...