Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings

Details Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings

2001-01-27

arxiv.org/abs/cs/0101033v1

SIAM Journal on Discrete Mathematics, 12(3):317--325, 1999

Computer Science

Data Structures and Algorithms

Scientific paper

Let G be an embedded planar undirected graph that has n vertices, m edges, and f faces but has no self-loop or multiple edge. If G is triangulated, we can encode it using {4/3}m-1 bits, improving on the best previous bound of about 1.53m bits. In case exponential time is acceptable, roughly 1.08m bits have been known to suffice. If G is triconnected, we use at most (2.5+2\log{3})\min\{n,f\}-7 bits, which is at most 2.835m bits and smaller than the best previous bound of 3m bits. Both of our schemes take O(n) time for encoding and decoding.

Affiliated with

Also associated with

No associations

Rating

Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-278191