DOIAbstract
AbstractIt is shown that unlabeled planar graphs can be encoded using 12n bits, and an asymptotically optimal representation is given for labeled planar graphs
AbstractIt is shown that unlabeled planar graphs can be encoded using 12n bits, and an asymptotically optimal representation is given for labeled planar graphs
There are many representations of planar graphs, but few are as elegant as Turan's (1984): it is sim...
How to represent a graph in memory is a fundamental data-structuring problem. In the usual represent...
We present time-efficient algorithms for encoding (and decoding) planar orthogonal drawings of degre...
AbstractIt is shown that unlabeled planar graphs can be encoded using 12n bits, and an asymptoticall...
AbstractWe show that general unlabeled graphs on n nodes can be represented by (n2) − n log2 n + O(n...
AbstractWe discuss space-efficient encoding schemes for planar graphs and maps. Our results improve ...
We propose a new linear time algorithm to represent a planar graph. Based on a specific triangulati...
We consider the problem of finding succinct representations of graphs, that is, encodings using asym...
Abstract. We propose a fast methodology for encoding graphs with information-theoretically minimum n...
In many applications, the properties of an object being modeled are stored as labels on vertices or ...
In many applications, the properties of an object being modeled are stored as labels on vertices or ...
Abstract. We consider the problem of coding planar graphs by binary strings. Depending on whether O(...
35 pages; 8 figuresInternational audienceWe show that there exists an adjacency labelling scheme for...
International audienceThe family of well-orderly maps is a family of planar maps with the property t...
Rapport de rechercheThe family of well-orderly maps is a family of planar maps with the property tha...
There are many representations of planar graphs, but few are as elegant as Turan's (1984): it is sim...
How to represent a graph in memory is a fundamental data-structuring problem. In the usual represent...
We present time-efficient algorithms for encoding (and decoding) planar orthogonal drawings of degre...
AbstractIt is shown that unlabeled planar graphs can be encoded using 12n bits, and an asymptoticall...
AbstractWe show that general unlabeled graphs on n nodes can be represented by (n2) − n log2 n + O(n...
AbstractWe discuss space-efficient encoding schemes for planar graphs and maps. Our results improve ...
We propose a new linear time algorithm to represent a planar graph. Based on a specific triangulati...
We consider the problem of finding succinct representations of graphs, that is, encodings using asym...
Abstract. We propose a fast methodology for encoding graphs with information-theoretically minimum n...
In many applications, the properties of an object being modeled are stored as labels on vertices or ...
In many applications, the properties of an object being modeled are stored as labels on vertices or ...
Abstract. We consider the problem of coding planar graphs by binary strings. Depending on whether O(...
35 pages; 8 figuresInternational audienceWe show that there exists an adjacency labelling scheme for...
International audienceThe family of well-orderly maps is a family of planar maps with the property t...
Rapport de rechercheThe family of well-orderly maps is a family of planar maps with the property tha...
There are many representations of planar graphs, but few are as elegant as Turan's (1984): it is sim...
How to represent a graph in memory is a fundamental data-structuring problem. In the usual represent...
We present time-efficient algorithms for encoding (and decoding) planar orthogonal drawings of degre...
Add to ORKG