AbstractWe discuss space-efficient encoding schemes for planar graphs and maps. Our results improve on the constants of previous schemes and can be achieved with simple encoding algorithms. They are near-optimal in number of bits per edge
We consider the problem of designing compact and succint representations for geometric data structur...
An \emph{adjacency labeling scheme} for a given class of graphs is an algorithm that for every grap...
We present a new representation that is guaranteed to encode any planar triangle graph of V vertices...
AbstractWe discuss space-efficient encoding schemes for planar graphs and maps. Our results improve ...
AbstractIt is shown that unlabeled planar graphs can be encoded using 12n bits, and an asymptoticall...
Abstract. We consider the problem of coding planar graphs by binary strings. Depending on whether O(...
Abstract. We propose a fast methodology for encoding graphs with information-theoretically minimum n...
Let $G$ be an unlabeled planar and simple $n$-vertex graph. {We present a succinct encoding of $G$ t...
There are many representations of planar graphs, but few are as elegant as Turan's (1984): it is sim...
We present a novel space-efficient graph coarsening technique for n-vertex planar graphs G, called c...
AbstractThis paper addresses the problem of representing the connectivity information of geometric o...
International audienceThe family of well-orderly maps is a family of planar maps with the property t...
This paper addresses the problem of representing the connectivity information of geometric objects u...
International audienceThis paper addresses the problem of representing the connectivity information ...
Rapport de rechercheThe family of well-orderly maps is a family of planar maps with the property tha...
We consider the problem of designing compact and succint representations for geometric data structur...
An \emph{adjacency labeling scheme} for a given class of graphs is an algorithm that for every grap...
We present a new representation that is guaranteed to encode any planar triangle graph of V vertices...
AbstractWe discuss space-efficient encoding schemes for planar graphs and maps. Our results improve ...
AbstractIt is shown that unlabeled planar graphs can be encoded using 12n bits, and an asymptoticall...
Abstract. We consider the problem of coding planar graphs by binary strings. Depending on whether O(...
Abstract. We propose a fast methodology for encoding graphs with information-theoretically minimum n...
Let $G$ be an unlabeled planar and simple $n$-vertex graph. {We present a succinct encoding of $G$ t...
There are many representations of planar graphs, but few are as elegant as Turan's (1984): it is sim...
We present a novel space-efficient graph coarsening technique for n-vertex planar graphs G, called c...
AbstractThis paper addresses the problem of representing the connectivity information of geometric o...
International audienceThe family of well-orderly maps is a family of planar maps with the property t...
This paper addresses the problem of representing the connectivity information of geometric objects u...
International audienceThis paper addresses the problem of representing the connectivity information ...
Rapport de rechercheThe family of well-orderly maps is a family of planar maps with the property tha...
We consider the problem of designing compact and succint representations for geometric data structur...
An \emph{adjacency labeling scheme} for a given class of graphs is an algorithm that for every grap...
We present a new representation that is guaranteed to encode any planar triangle graph of V vertices...
DOI
Add to ORKG