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...
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...
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...
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...