Efficient Encoding of Planar Graphs: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 02:0002:00, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,492 bytes +1,492‎ Created page with "Title: Efficient Encoding of Planar Graphs Research Question: How can we efficiently encode planar graphs with different levels of query support? Methodology: The researchers proposed three sets of coding schemes for a given planar graph G. These schemes utilize new properties of canonical orderings and multiple parentheses techniques to encode and decode the graph in O(m+n) time. The bit counts for these schemes depend on the level of query support and the structure o..."
Retrieved from "https://simplesci.org/wiki/Efficient_Encoding_of_Planar_Graphs"