2680 search results - page 117 / 536 » The topology of the independence complex |
110
click to vote
WABI
2001
Springer
15 years 5 months ago
2001
Springer
We develop fast algorithms for computing the linking number of a simplicial complex within a filtration. We give experimental results in applying our work toward the detection of...
105
click to vote
ICOIN
2005
Springer
15 years 6 months ago
2005
Springer
This paper proposes a rerouting scheme that can be applied to the restoration of working Label Switched Paths (LSPs) and preprovisioned backup LSPs, which consists of two subsequen...
119
click to vote
GD
2004
Springer
15 years 6 months ago
2004
Springer
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...
ICPADS
1998
IEEE
15 years 4 months ago
1998
IEEE
With respect to scalability and arbitrary topologies of the underlying networks in multiprogramming and multithread environment, fault tolerance in acknowledged ATAB and concurren...
102
click to vote
DC
2007
15 years 1 months ago
2007
An important problem in distributed systems is to detect termination of a distributed computation. A computation is said to have terminated when all processes have become passive a...