315 search results - page 3 / 63 » Eigenvalue bounds for independent sets |
LATIN
2004
Springer
14 years 24 days ago
2004
Springer
Given a finite set V , and integers k ≥ 1 and r ≥ 0, denote by A(k, r) the class of hypergraphs A ⊆ 2V with (k, r)-bounded intersections, i.e. in which the intersection of a...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
WASA
2009
Springer
14 years 2 months ago
2009
Springer
This paper addresses the following optimization problem in a plane multihop wireless networks under the physical interference model: From a given a set of communication links whose...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present algorithmic lower bounds on the size of the largest independent sets of vertices in a random d-regular graph. Our bounds hold with probability approaching one ...
DM
2002
13 years 7 months ago
2002
We consider a variation of the chip-firing game in a induced subgraph S of a graph G. Starting from a given chip configuration, if a vertex v has at least as many chips as its deg...