DOIAbstract
AbstractWe show that general unlabeled graphs on n nodes can be represented by (n2) − n log2 n + O(n) bits which is optimal up to the O(n) term. Both the encoding and decoding require linear time
AbstractWe show that general unlabeled graphs on n nodes can be represented by (n2) − n log2 n + O(n) bits which is optimal up to the O(n) term. Both the encoding and decoding require linear time
How to represent a graph in memory is a fundamental data structuring problem. In the usual represent...
International audienceLinearity and contiguity are two parameters devoted to graph encoding. Lineari...
AbstractLet G be an unweighted and undirected graph of n nodes, and let D be the n×n matrix storing ...
AbstractWe show that general unlabeled graphs on n nodes can be represented by (n2) − n log2 n + O(n...
AbstractIt is shown that unlabeled planar graphs can be encoded using 12n bits, and an asymptoticall...
Abstract. We propose a fast methodology for encoding graphs with information-theoretically minimum n...
1 I n t roduct ion This extended abstract summarizes a new result for the graph compression problem,...
How to represent a graph in memory is a fundamental data-structuring problem. In the usual represent...
Let G be an unweighted and undirected graph of n nodes, and let D be the n x n matrix storing the Al...
We consider the problem of finding succinct representations of graphs, that is, encodings using asym...
In this paper we show an information-theoretic lower bound of kn - o(kn) on the minimum number of bi...
We consider the problem of designing succinct data structures for interval graphs with n vertices wh...
Abstract. We consider the problem of coding planar graphs by binary strings. Depending on whether O(...
We give an efficient encoding and decoding scheme for computing a compact representation of a graph ...
We aim at assigning each vertex x of a n-vertices graph G a compact O(log n)-bit label L(x) in order...
How to represent a graph in memory is a fundamental data structuring problem. In the usual represent...
International audienceLinearity and contiguity are two parameters devoted to graph encoding. Lineari...
AbstractLet G be an unweighted and undirected graph of n nodes, and let D be the n×n matrix storing ...
AbstractWe show that general unlabeled graphs on n nodes can be represented by (n2) − n log2 n + O(n...
AbstractIt is shown that unlabeled planar graphs can be encoded using 12n bits, and an asymptoticall...
Abstract. We propose a fast methodology for encoding graphs with information-theoretically minimum n...
1 I n t roduct ion This extended abstract summarizes a new result for the graph compression problem,...
How to represent a graph in memory is a fundamental data-structuring problem. In the usual represent...
Let G be an unweighted and undirected graph of n nodes, and let D be the n x n matrix storing the Al...
We consider the problem of finding succinct representations of graphs, that is, encodings using asym...
In this paper we show an information-theoretic lower bound of kn - o(kn) on the minimum number of bi...
We consider the problem of designing succinct data structures for interval graphs with n vertices wh...
Abstract. We consider the problem of coding planar graphs by binary strings. Depending on whether O(...
We give an efficient encoding and decoding scheme for computing a compact representation of a graph ...
We aim at assigning each vertex x of a n-vertices graph G a compact O(log n)-bit label L(x) in order...
How to represent a graph in memory is a fundamental data structuring problem. In the usual represent...
International audienceLinearity and contiguity are two parameters devoted to graph encoding. Lineari...
AbstractLet G be an unweighted and undirected graph of n nodes, and let D be the n×n matrix storing ...
Add to ORKG