69 search results - page 10 / 14 » The cover time of sparse random graphs |
126
click to vote
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...
117
click to vote
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
WEA
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...
103
click to vote
APPROX
2004
Springer
15 years 7 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
121
click to vote
CIAC
2010
Springer
15 years 11 months ago
2010
Springer
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...