VIA CANONICAL ORDERINGS: 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 01:5901:59, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,479 bytes +1,479‎ Created page with "Title: VIA CANONICAL ORDERINGS Research Question: How can we encode a planar graph using the fewest number of bits while maintaining its structure? Methodology: The researchers proposed a method to encode a planar graph using a canonical ordering, which is a specific ordering of the vertices that maintains the graph's structure. They considered two scenarios: when the graph is triangulated (meaning it has been turned into a set of triangles) and when it is triconnected..."
Retrieved from "https://simplesci.org/wiki/VIA_CANONICAL_ORDERINGS"