3008 search results - page 289 / 602 » Independence in connected graphs |
220
click to vote
LCC
1994
15 years 10 months ago
1994
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
154
click to vote
COMPGEOM
1995
ACM
15 years 10 months ago
1995
ACM
We outline an algorithm and implementation of a system that computes Boolean combinations of sculptured solids. We represent the surface of the solids in terms of trimmed and untr...
177
click to vote
SODA
2007
ACM
15 years 8 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
162
click to vote
WSC
1997
15 years 8 months ago
1997
Techniques to visualize quantitative discrete event simulation input and output data are presented. General concepts connected with graphical excellence are discussed in a simulat...
158
click to vote
APPML
2006
15 years 6 months ago
2006
We show that a combinatorial question which has been studied in connection with lower bounds for the knapsack problem by Brimkov and Dantchev (2001) is related to threshold graphs...