139 search results - page 10 / 28 » The Domatic Number of Regular Graphs |
110
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
104
click to vote
SIROCCO
2000
15 years 1 months ago
2000
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
TC
1998
14 years 11 months ago
1998
A bipartite concentrator is a single stage sparse crossbar switching device that can connect any m of its n ≥ m inputs to its m outputs possibly without the ability to distingui...
104
click to vote
ICIP
2008
IEEE
15 years 6 months ago
2008
IEEE
In the area of depth estimation from images an interesting approach has been structure recovery from defocus cue. Towards this end, there have been a number of approaches [4, 6]. ...
FSTTCS
2006
Springer
15 years 3 months ago
2006
Springer
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...