1199 search results - page 143 / 240 » Graph Theory |
156
click to vote
RSA
2010
15 years 2 months ago
2010
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...
ICCS
1995
Springer
15 years 7 months ago
1995
Springer
Thenotion of context is indispensable in discussions of meaning,but the wordcontext has often beenusedin conflicting senses. In logic, the first representation of contextas a forma...
202
click to vote
PODC
2011
ACM
14 years 6 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
136
Voted
SC
2003
ACM
15 years 9 months ago
2003
ACM
Realistic workloads are essential in evaluating middleware for computational grids. One important component is the raw grid itself: a network topology graph annotated with the har...
108
click to vote
ICRA
2006
IEEE
15 years 10 months ago
2006
IEEE
- This paper introduces a new approach to identify singularities of planar parallel manipulators (PPMs). This method is based on Maxwell’s reciprocal figure theory which establis...