Graph flattenability
id:
graph-flattenability-318-9217758
title:
Graph flattenability
text:
Flattenability in some d -dimensional normed vector space is a property of graphs which states that any embedding, or drawing, of the graph in some high dimension d ′ can be "flattened" down to live in d -dimensions, such that the distances between pairs of points connected by edges are preserved. A graph G is d -flattenable if every distance constraint system (DCS) with G as its constraint graph has a d -dimensional framework. Flattenability was first called realizability, but the name was chan
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Graph_flattenability
date created:
date modified:
2024-01-05T09:53:17Z
main entity:
{"identifier":"Q111955002","url":"https://www.wikidata.org/entity/Q111955002"}
image:
fields total:
13
integrity:
13