4865 search results - page 690 / 973 » The Complexity of Graph Connectivity |
120
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The paper presents the position analysis of a spatial structure composed of two platforms mutually connected by one RRP and three SS serial kinematic chains, where R, P, and S sta...
168
click to vote
CONSTRAINTS
2008
15 years 5 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
115
click to vote
DCG
2010
15 years 5 months ago
2010
: We investigate polyhedral 2k-manifolds as subcomplexes of the boundary complex of a regular polytope. We call such a subcomplex k-Hamiltonian if it contains the full k-skeleton o...
126
Voted
JPDC
2008
15 years 4 months ago
2008
We investigate the problem of detecting termination of a distributed computation in systems where processes can fail by crashing. Specifically, when the communication topology is ...
123
Voted
MP
2008
15 years 4 months ago
2008
Abstract. We attempt a broad exploration of properties and connections between the symmetry function of a convex set S IRn and other arenas of convexity including convex functions...