| http://dbpedia.org/ontology/abstract
|
Flattenability in some -dimensional normed … Flattenability in some -dimensional normed vector space is a property of graphs which states that any embedding, or drawing, of the graph in some high dimension can be "flattened" down to live in -dimensions, such that the distances between pairs of points connected by edges are preserved. A graph is -flattenable if every (DCS) with as its constraint graph has a -dimensional . Flattenability was first called realizability, but the name was changed to avoid confusion with a graph having some DCS with a -dimensional framework. Flattenability has connections to structural rigidity, tensegrities, Cayley configuration spaces, and a variant of the Graph Realization Problem. variant of the Graph Realization Problem.
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/FilePath/1-flat.jpg?width=300 +
|
| http://dbpedia.org/ontology/wikiPageID
|
66487331
|
| http://dbpedia.org/ontology/wikiPageLength
|
27330
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1108297624
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/File:Octahedron_embedding.gif +
, http://dbpedia.org/resource/File:Partial_3-tree_forb_min.jpg +
, http://dbpedia.org/resource/Norm_%28mathematics%29 +
, http://dbpedia.org/resource/File:1-flat.jpg +
, http://dbpedia.org/resource/File:1_flat_nonex.jpg +
, http://dbpedia.org/resource/Structural_rigidity +
, http://dbpedia.org/resource/Geometric_constraint_system +
, http://dbpedia.org/resource/Graph_%28discrete_mathematics%29 +
, http://dbpedia.org/resource/Graph_realization_problem +
, http://dbpedia.org/resource/Generic_property +
, http://dbpedia.org/resource/Clique-sum%7D +
, http://dbpedia.org/resource/Normed_vector_space +
, http://dbpedia.org/resource/N-skeleton +
, http://dbpedia.org/resource/Recursion +
, http://dbpedia.org/resource/Tree_%28graph_theory%29 +
, http://dbpedia.org/resource/Graph_embedding +
, http://dbpedia.org/resource/Mathematical_folklore +
, http://dbpedia.org/resource/Graph_drawing +
, http://dbpedia.org/resource/Category:Graphs +
, http://dbpedia.org/resource/Algebraic_geometry +
, http://dbpedia.org/resource/Category:Graph_theory +
, http://dbpedia.org/resource/Euclidean_space +
, http://dbpedia.org/resource/Rigidity_matroid +
, http://dbpedia.org/resource/Graph_minor +
, http://dbpedia.org/resource/Semidefinite_programming +
, http://dbpedia.org/resource/Tensegrity +
, http://dbpedia.org/resource/Euclidean_distance +
, http://dbpedia.org/resource/Time_complexity +
, http://dbpedia.org/resource/Semialgebraic_set +
, http://dbpedia.org/resource/Graph_flattenability +
, http://dbpedia.org/resource/Wheel_graph +
, http://dbpedia.org/resource/Partial_k-tree +
, http://dbpedia.org/resource/Straightedge_and_compass_construction +
, http://dbpedia.org/resource/Cayley_configuration_space +
, http://dbpedia.org/resource/Triangle_inequality +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Authority_control +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Graph_theory +
, http://dbpedia.org/resource/Category:Graphs +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Graph_flattenability?oldid=1108297624&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/FilePath/1_flat_nonex.jpg +
, http://commons.wikimedia.org/wiki/Special:FilePath/FilePath/Octa.gif +
, http://commons.wikimedia.org/wiki/Special:FilePath/FilePath/Partial_3-tree_forb_min.jpg +
, http://commons.wikimedia.org/wiki/Special:FilePath/FilePath/1-flat.jpg +
, http://commons.wikimedia.org/wiki/Special:FilePath/Partial_3-tree_forb_min.jpg +
, http://commons.wikimedia.org/wiki/Special:FilePath/Octahedron_embedding.gif +
, http://commons.wikimedia.org/wiki/Special:FilePath/1_flat_nonex.jpg +
, http://commons.wikimedia.org/wiki/Special:FilePath/1-flat.jpg +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Graph_flattenability +
|
| owl:sameAs |
https://global.dbpedia.org/id/GTwMz +
, http://www.wikidata.org/entity/Q111955002 +
, http://dbpedia.org/resource/Graph_flattenability +
|
| rdfs:comment |
Flattenability in some -dimensional normed … Flattenability in some -dimensional normed vector space is a property of graphs which states that any embedding, or drawing, of the graph in some high dimension can be "flattened" down to live in -dimensions, such that the distances between pairs of points connected by edges are preserved. A graph is -flattenable if every (DCS) with as its constraint graph has a -dimensional . Flattenability was first called realizability, but the name was changed to avoid confusion with a graph having some DCS with a -dimensional framework.ng some DCS with a -dimensional framework.
|
| rdfs:label |
Graph flattenability
|
