1101 search results - page 61 / 221 » An Algorithm for the Graph Crossing Number Problem |
102
Voted
SOFSEM
1997
Springer
15 years 6 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
114
Voted
PDPTA
2007
15 years 3 months ago
2007
- The MASC (for Multiple Associative Computing) model is a SIMD model enhanced with associative properties and multiple synchronous instruction streams (IS). A number of algorithms...
110
Voted
PODC
2009
ACM
16 years 3 months ago
2009
ACM
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
108
click to vote
AAAI
1996
15 years 3 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
106
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...