1729 search results - page 218 / 346 » Bound Graph Polysemy |
166
click to vote
COCOA
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
144
click to vote
COCOON
2007
Springer
16 years 16 days ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
187
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
193
click to vote
CN
2010
15 years 3 months ago
2010
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
179
click to vote
DM
2011
15 years 1 months ago
2011
If X is a geodesic metric space and x1, x2, x3 ∈ X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X. The space X is δ-hy...