157 search results - page 1 / 32 » Compact representations of separable graphs |
SODA
2003
ACM
13 years 6 months ago
2003
ACM
We consider the problem of representing graphs compactly while supporting queries efficiently. In particular we describe a data structure for representing n-vertex unlabeled graph...
ALENEX
2004
13 years 6 months ago
2004
In previous work we described a method for compactly representing graphs with small separators, which makes use of small separators, and presented preliminary experimental results...
DAM
2007
13 years 4 months ago
2007
Given a graph G = (V, E) with a cost function c(S) ≥ 0 ∀S ⊆ V , we want to represent all possible min-cut values between pairs of vertices i and j. We consider also the spec...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
BIRTHDAY
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Many relevant Web mining tasks translate into classical algorithms on the Web graph. Compact Web graph representations allow running these tasks on larger graphs within m...