The Lattice Dimension of a Graph: 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 15:2315:23, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,634 bytes +1,634‎ Created page with "Title: The Lattice Dimension of a Graph Research Question: Can we find the minimum number of dimensions needed to represent a graph on a lattice? Methodology: The researchers used a polynomial time algorithm to find the minimum lattice dimension for an undirected graph. They considered embedding the graph into a d-dimensional integer lattice, Zd, such that the distance between two vertices is equal to the L1-distance between their coordinates. Results: They found that..."
Retrieved from "https://simplesci.org/wiki/The_Lattice_Dimension_of_a_Graph"