Results 1 
5 of
5
Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses
, 1998
"... . We consider the problem of coding planar graphs by binary strings. Depending on whether O(1)time queries for adjacency and degree are supported, we present three sets of coding schemes which all take linear time for encoding and decoding. The encoding lengths are significantly shorter than th ..."
Abstract

Cited by 47 (11 self)
 Add to MetaCart
. We consider the problem of coding planar graphs by binary strings. Depending on whether O(1)time queries for adjacency and degree are supported, we present three sets of coding schemes which all take linear time for encoding and decoding. The encoding lengths are significantly shorter than the previously known results in each case. 1 Introduction This paper investigates the problem of encoding a graph G with n nodes and m edges into a binary string S. This problem has been extensively studied with three objectives: (1) minimizing the length of S, (2) minimizing the time needed to compute and decode S, and (3) supporting queries efficiently. A number of coding schemes with different tradeoffs have been proposed. The adjacencylist encoding of a graph is widely useful but requires 2mdlog ne bits. (All logarithms are of base 2.) A folklore scheme uses 2n bits to encode a rooted nnode tree into a string of n pairs of balanced parentheses. Since the total number of such trees is...
Compact Routing Tables for Graphs of Bounded Genus
, 2000
"... This paper deals with compact shortest path routing tables on weighted graphs with n nodes. For planar graphs we show how to construct in linear time shortest path routing tables that require 8n + o(n) bits per node, and O(log 2+ n) bitoperations per node to extract the route, for any constant > 0. ..."
Abstract

Cited by 30 (12 self)
 Add to MetaCart
This paper deals with compact shortest path routing tables on weighted graphs with n nodes. For planar graphs we show how to construct in linear time shortest path routing tables that require 8n + o(n) bits per node, and O(log 2+ n) bitoperations per node to extract the route, for any constant > 0. We obtain the same bounds for graphs of crossingedge number bounded by o(n= log n), and we generalize for graphs of genus bounded by > 0 yielding a size of n log +O(n) bits per node. Actually we prove a sharp upper bound of 2n log k +O(n) for graphs of pagenumber k, and a lower bound of n log k o(n log k) bits. These results are obtained by the use of dominating sets, compact coding of noncrossing partitions, and kpage representation of graphs.
A Fast General Methodology For InformationTheoretically Optimal Encodings Of Graphs
, 1999
"... . We propose a fast methodology for encoding graphs with informationtheoretically minimum numbers of bits. Specifically, a graph with property is called a graph. If satisfies certain properties, then an nnode medge graph G can be encoded by a binary string X such that (1) G and X can be obtai ..."
Abstract

Cited by 23 (3 self)
 Add to MetaCart
. We propose a fast methodology for encoding graphs with informationtheoretically minimum numbers of bits. Specifically, a graph with property is called a graph. If satisfies certain properties, then an nnode medge graph G can be encoded by a binary string X such that (1) G and X can be obtained from each other in O(n log n) time, and (2) X has at most fi(n)+o(fi(n)) bits for any continuous superadditive function fi(n) so that there are at most 2 fi(n)+o(fi(n)) distinct nnode graphs. The methodology is applicable to general classes of graphs; this paper focuses on planar graphs. Examples of such include all conjunctions over the following groups of properties: (1) G is a planar graph or a plane graph; (2) G is directed or undirected; (3) G is triangulated, triconnected, biconnected, merely connected, or not required to be connected; (4) the nodes of G are labeled with labels from f1; : : : ; ` 1 g for ` 1 n; (5) the edges of G are labeled with labels from f1; : : : ; ` 2 ...
Compact Routing Tables for Graphs of Bounded Genus (Extended Abstract)
, 1999
"... For planar graphs on n nodes we show how to construct in linear time shortest path routing tables that require 8n + o(n) bits per node, and O(log 2+ n) bitoperations per node to extract the route, with constant > 0. We generalize the result for every graph of bounded crossingedge number. W ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
For planar graphs on n nodes we show how to construct in linear time shortest path routing tables that require 8n + o(n) bits per node, and O(log 2+ n) bitoperations per node to extract the route, with constant > 0. We generalize the result for every graph of bounded crossingedge number. We also extend our result to any graph of genus bounded by , by building shortest path routing tables of n log ( + 1) + O(n) bits per node, and with O(log 2+ n) bitoperations per node to extract the route. This result is obtained by the use of dominating sets, compact coding of noncrossing partitions, and kpage representation of graphs.
On Homogeneous Graphs and Posets
, 2003
"... We present a class P2 of simple nite structures which induce the countable homogeneous universal poset. We also de ne the notion of a nitely presented countable structure and conjecture that every generic structure for a nitely axiomatizable class of structures is nitely presented. This is v ..."
Abstract
 Add to MetaCart
We present a class P2 of simple nite structures which induce the countable homogeneous universal poset. We also de ne the notion of a nitely presented countable structure and conjecture that every generic structure for a nitely axiomatizable class of structures is nitely presented. This is veri ed for undirected graphs, tournaments and posets. The structure P2 extends Conway's surreal numbers and their linear ordering to posets.