Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Graph_embedding> ?p ?o }
Showing triples 1 to 25 of
25
with 100 triples per page.
- Graph_embedding abstract "In topological graph theory, an embedding (also spelled imbedding) of a graph on a surface Σ is a representation of on Σ in which points of Σ are associated to vertices and simple arcs (homeomorphic images of [0,1]) are associated to edges in such a way that: the endpoints of the arc associated to an edge are the points associated to the end vertices of , no arcs include points associated with other vertices, two arcs never intersect at a point which is interior to either of the arcs.Here a surface is a compact, connected 2-manifold.Informally, an embedding of a graph into a surface is a drawing of the graph on the surface in such a way that its edges may intersect only at their endpoints. It is well known that any graph can be embedded in 3-dimensional Euclidean space and planar graphs can be embedded in 2-dimensional Euclidean space .Often, an embedding is regarded as an equivalence class (under homeomorphisms of Σ) of representations of the kind just described.Some authors define a weaker version of the definition of "graph embedding" by omitting the non-intersection condition for edges. In such contexts the stricter definition is described as "non-crossing graph embedding".This article deals only with the strict definition of graph embedding. The weaker definition is discussed in the articles "graph drawing" and "crossing number".".
- Graph_embedding wikiPageID "8149170".
- Graph_embedding wikiPageRevisionID "594213559".
- Graph_embedding hasPhotoCollection Graph_embedding.
- Graph_embedding subject Category:Graph_algorithms.
- Graph_embedding subject Category:Topological_graph_theory.
- Graph_embedding type Abstraction100002137.
- Graph_embedding type Act100030358.
- Graph_embedding type Activity100407535.
- Graph_embedding type Algorithm105847438.
- Graph_embedding type Event100029378.
- Graph_embedding type GraphAlgorithms.
- Graph_embedding type Procedure101023820.
- Graph_embedding type PsychologicalFeature100023100.
- Graph_embedding type Rule105846932.
- Graph_embedding type YagoPermanentlyLocatedEntity.
- Graph_embedding comment "In topological graph theory, an embedding (also spelled imbedding) of a graph on a surface Σ is a representation of on Σ in which points of Σ are associated to vertices and simple arcs (homeomorphic images of [0,1]) are associated to edges in such a way that: the endpoints of the arc associated to an edge are the points associated to the end vertices of , no arcs include points associated with other vertices, two arcs never intersect at a point which is interior to either of the arcs.Here a surface is a compact, connected 2-manifold.Informally, an embedding of a graph into a surface is a drawing of the graph on the surface in such a way that its edges may intersect only at their endpoints. ".
- Graph_embedding label "Graph embedding".
- Graph_embedding label "圖嵌入".
- Graph_embedding sameAs m.026td5b.
- Graph_embedding sameAs Q5597085.
- Graph_embedding sameAs Q5597085.
- Graph_embedding sameAs Graph_embedding.
- Graph_embedding wasDerivedFrom Graph_embedding?oldid=594213559.
- Graph_embedding isPrimaryTopicOf Graph_embedding.