AbstractIt is shown that unlabeled planar graphs can be encoded using 12n bits, and an asymptotically optimal representation is given for labeled planar graphs
We present a novel space-efficient graph coarsening technique for n-vertex planar graphs G, called c...
We consider the problem of highly space-efficient representation of separable graphs while supportin...
We propose a new linear time algorithm to represent a planar graph. Based on a specific triangulati...
AbstractIt is shown that unlabeled planar graphs can be encoded using 12n bits, and an asymptoticall...
AbstractWe discuss space-efficient encoding schemes for planar graphs and maps. Our results improve ...
AbstractWe show that general unlabeled graphs on n nodes can be represented by (n2) − n log2 n + O(n...
A preliminary version of this work appeared as extended abstract in the Proc. of ISAAC 2007Internati...
We consider the problem of finding succinct representations of graphs, that is, encodings using asym...
In many applications, the properties of an object being modeled are stored as labels on vertices or ...
Let $G$ be an unlabeled planar and simple $n$-vertex graph. {We present a succinct encoding of $G$ t...
Abstract. We consider the problem of coding planar graphs by binary strings. Depending on whether O(...
An \emph{adjacency labeling scheme} for a given class of graphs is an algorithm that for every grap...
International audienceThe family of well-orderly maps is a family of planar maps with the property t...
Abstract. We propose a fast methodology for encoding graphs with information-theoretically minimum n...
Rapport de rechercheThe family of well-orderly maps is a family of planar maps with the property tha...
We present a novel space-efficient graph coarsening technique for n-vertex planar graphs G, called c...
We consider the problem of highly space-efficient representation of separable graphs while supportin...
We propose a new linear time algorithm to represent a planar graph. Based on a specific triangulati...
AbstractIt is shown that unlabeled planar graphs can be encoded using 12n bits, and an asymptoticall...
AbstractWe discuss space-efficient encoding schemes for planar graphs and maps. Our results improve ...
AbstractWe show that general unlabeled graphs on n nodes can be represented by (n2) − n log2 n + O(n...
A preliminary version of this work appeared as extended abstract in the Proc. of ISAAC 2007Internati...
We consider the problem of finding succinct representations of graphs, that is, encodings using asym...
In many applications, the properties of an object being modeled are stored as labels on vertices or ...
Let $G$ be an unlabeled planar and simple $n$-vertex graph. {We present a succinct encoding of $G$ t...
Abstract. We consider the problem of coding planar graphs by binary strings. Depending on whether O(...
An \emph{adjacency labeling scheme} for a given class of graphs is an algorithm that for every grap...
International audienceThe family of well-orderly maps is a family of planar maps with the property t...
Abstract. We propose a fast methodology for encoding graphs with information-theoretically minimum n...
Rapport de rechercheThe family of well-orderly maps is a family of planar maps with the property tha...
We present a novel space-efficient graph coarsening technique for n-vertex planar graphs G, called c...
We consider the problem of highly space-efficient representation of separable graphs while supportin...
We propose a new linear time algorithm to represent a planar graph. Based on a specific triangulati...
DOI
Add to ORKG