265 search results - page 24 / 53 » The independence number in graphs of maximum degree three |
COMBINATORICS
2004
14 years 9 months ago
2004
Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...
101
click to vote
CORR
2010
Springer
14 years 6 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
82
Voted
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...
GLOBECOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— In this paper we present protograph codes with a small number of degree-3 nodes and one high degree node. The iterative decoding threshold for proposed rate 1/2 codes are lower...
76
Voted
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— Packet buffers in router/switch interfaces constitute a central element of packet networks. The appropriate sizing of these buffers is an important and open research problem. M...