4865 search results - page 480 / 973 » The Complexity of Graph Connectivity |
166
click to vote
WABI
2007
Springer
16 years 1 months ago
2007
Springer
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
207
click to vote
WAW
2007
Springer
16 years 1 months ago
2007
Springer
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
176
click to vote
ICCS
1998
Springer
15 years 11 months ago
1998
Springer
Internet-based information technologies have considerable potential for improving collaboration in professional communities. In this paper, we explain the concept of user-driven sp...
208
click to vote
CONCUR
2006
Springer
15 years 10 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...
175
click to vote
DAM
2007
15 years 7 months ago
2007
In hardware design, it is necessary to simulate the anticipated behavior of the integrated circuit before it is actually cast in silicon. As simulation procedures are long due to ...