Sciweavers

2310 search results - page 50 / 462
» Coloring Random Graphs
Sort
View
EJC
2008
13 years 9 months ago
Expansion properties of a random regular graph after random vertex deletions
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n-...
Catherine S. Greenhill, Fred B. Holt, Nicholas C. ...
SIGMETRICS
2010
ACM
197views Hardware» more  SIGMETRICS 2010»
14 years 1 months ago
Coloring spatial point processes with applications to peer discovery in large wireless networks
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
Jian Ni, R. Srikant, Xinzhou Wu
COCOON
2007
Springer
14 years 29 days ago
Improved Exact Algorithms for Counting 3- and 4-Colorings
Abstract. We introduce a generic algorithmic technique and apply it on decision and counting versions of graph coloring. Our approach is based on the following idea: either a graph...
Fedor V. Fomin, Serge Gaspers, Saket Saurabh
MTA
2006
156views more  MTA 2006»
13 years 9 months ago
DAG-based visual interfaces for navigation in indexed video content
Indexing and segmenting of video content by motion, color and texture has been intensively explored leading to a usual representation in a storyboard. In this paper, a novel metho...
Maylis Delest, Anthony Don, Jenny Benois-Pineau
WG
2004
Springer
14 years 2 months ago
Coloring a Graph Using Split Decomposition
We show how to use split decomposition to compute the weighted clique number and the chromatic number of a graph and we apply these results to some classes of graphs. In particular...
Michaël Rao