2310 search results - page 194 / 462 » Coloring Random Graphs |
131
Voted
SODA
2012
ACM
13 years 4 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
103
click to vote
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
121
click to vote
SC
2005
ACM
15 years 8 months ago
2005
ACM
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadth...
125
click to vote
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...
147
click to vote
AVI
2006
15 years 3 months ago
2006
Scientific measurements are often depicted as line graphs. Stateof-the-art high throughput systems in life sciences, telemetry and electronics measurement rapidly generate hundred...