Sciweavers

315 search results - page 3 / 63
» Eigenvalue bounds for independent sets
Sort
View
LATIN
2004
Springer
15 years 11 months ago
Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
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...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
WADS
2007
Springer
78views Algorithms» more  WADS 2007»
16 years 4 days ago
Independent Sets in Bounded-Degree Hypergraphs
Magnús M. Halldórsson, Elena Losievs...
WASA
2009
Springer
165views Algorithms» more  WASA 2009»
16 years 19 days ago
Maximum Independent Set of Links under Physical Interference Model
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...
Peng-Jun Wan, Xiaohua Jia, F. Frances Yao
MFCS
2007
Springer
16 years 5 days ago
Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs
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 ...
William Duckworth, Michele Zito
DM
2002
86views more  DM 2002»
15 years 5 months ago
A chip-firing game and Dirichlet eigenvalues
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...
Fan R. K. Chung, Robert B. Ellis