Algorithms for the parallel construction of a succinct representation of planar graphs with planar embeddings
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
bitrank
LICENSE.txt
README.md
binary_trees.h
bit_array.c
bit_array.h
build.sh
defs.c
defs.h
lookup_tables.c
lookup_tables.h
main.c
malloc_count.c
malloc_count.h
planar_graph.c
planar_graph.h
pointer_based.c
pointer_based.h
spanning_tree.c
spanning_tree.h
succinct_tree.c
succinct_tree.h
util.c
util.h

README.md

Synopsis

This repository contains the implementation of the algorithms introduced in "L. Ferres, J. Fuentes-Sepúlveda, T. Gagie, M. He, G. Navarro, Fast and compact planar embeddings. WADS 2017."

To compile:

bash build.sh

For datasets, please visit http://www.dcc.uchile.cl/~jfuentess/pemb

Authors

  • Leo Ferres
  • José Fuentes-Sepúlveda
  • Travis Gagie
  • Meng He
  • Gonzalo Navarro