725 search results - page 48 / 145 » Bounding Degrees on RPL |
ENDM
2006
14 years 9 months ago
2006
We introduce the incidence game chromatic number which unifies the ideas of game chromatic number and incidence coloring number of an undirected graph. For kdegenerate graphs with...
GLOBECOM
2010
IEEE
14 years 7 months ago
2010
IEEE
We explore a few selected multiuser communication problems where the possibility of interference alignment, and consequently the total number of degrees of freedom (DoF) with chann...
WG
2001
Springer
15 years 2 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
WCNC
2010
IEEE
15 years 1 months ago
2010
IEEE
—In this paper, we study node connectivity in multi-hop wireless networks. Nodal degree of connectivity as one of the fundamental graph properties is the basis for the study of n...
CIAC
1997
Springer
15 years 1 months ago
1997
Springer
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...