168 search results - page 20 / 34 » New upper bounds on the decomposability of planar graphs |
STOC
1995
ACM
13 years 10 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
ALGORITHMICA
2000
13 years 6 months ago
2000
Complexity bounds for algorithms for robotic motion and manipulation can be misleading when they are constructed with pathological `worst-case' scenarios that rarely appear i...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
—Geographic routing protocols like GOAFR or GPSR rely on exact location information at the nodes, because when the greedy routing phase gets stuck at a local minimum, they requir...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
ICDCS
2002
IEEE
13 years 11 months ago
2002
IEEE
Abstract—We propose a new geometric spanner for wireless ad hoc networks, which can be constructed efficiently in a distributed manner. It integrates the connected dominating se...