2125 search results - page 173 / 425 » On Graph Complexity |
147
click to vote
INFOCOM
2012
IEEE
13 years 5 months ago
2012
IEEE
—This paper builds a generic modeling framework for analyzing the edge-creation process in dynamic random graphs in which nodes continuously alternate between active and inactive...
141
click to vote
CONCUR
2006
Springer
15 years 6 months ago
2006
Springer
Event structures have been used for giving true concurrent semantics to languages and models of concurrency such as CCS, Petri nets and graph grammars. Although certain nominal cal...
GD
2007
Springer
15 years 9 months ago
2007
Springer
We propose a visualization approach for large dynamic graph structures with high degree variation and low diameter. In particular, we reduce visual complexity by multiple modes of ...
116
click to vote
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
142
click to vote
ISPA
2007
Springer
15 years 9 months ago
2007
Springer
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also suppo...