70 search results - page 6 / 14 » On low degree k-ordered graphs |
145
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
119
Voted
QSHINE
2005
IEEE
15 years 7 months ago
2005
IEEE
—We propose an adaptive hybrid automatic repeat request–forward error correction (ARQ–FEC) erasure-correcting scheme for quality of service (QoS)-driven mobile multicast serv...
110
Voted
EJC
2008
15 years 1 months ago
2008
Abstract. We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new ...
121
Voted
NETWORKING
2007
15 years 3 months ago
2007
This paper addresses the study of fundamental properties of stream-based content distribution services. We assume the presence of an overlay network with limited connectivity degre...
106
click to vote
AINA
2010
IEEE
15 years 6 months ago
2010
IEEE
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...