3 search results - page 1 / 1 » On the Maximum Span of Fixed-Angle Chains |
88
Voted
CCCG
2006
15 years 2 months ago
2006
Soss proved that it is NP-hard to find the maximum flat span of a fixed-angle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These f...
111
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...
88
Voted
FLAIRS
2001
15 years 2 months ago
2001
Decisionand optimizationproblemsinvolvinggraphsarise in manyareas of artificial intelligence, including probabilistic networks, robot navigation, and network design. Manysuch prob...