In the mathematical field of graph theory, an implicit graph representation or simply implicit graph is a graph whose set of vertices or edges or both are not known in advance, but rather determined according to certain rules. This notion is common in various search algorithms which are described in terms of search graphs. In this context, an implicit graph may be defined as a set of rules to define all neighbors for any specified vertex.
| Property | Value |
|---|
| dbpprop:abstract
|
- In the mathematical field of graph theory, an implicit graph representation or simply implicit graph is a graph whose set of vertices or edges or both are not known in advance, but rather determined according to certain rules. This notion is common in various search algorithms which are described in terms of search graphs. In this context, an implicit graph may be defined as a set of rules to define all neighbors for any specified vertex. In the context of efficient representations of graphs, Jeremy P. Spinrad defines an implicit representation of an n-vertex graph G as assigning <math>O(\log n)</math> graph bits to every vertex of G together with an algorithm to determine whether two vertices are adjacent from the corresponding bit sequences. not all classes of graphs have this kind of representation.
|
| dbpprop:reference
| |
| rdfs:comment
|
- In the mathematical field of graph theory, an implicit graph representation or simply implicit graph is a graph whose set of vertices or edges or both are not known in advance, but rather determined according to certain rules. This notion is common in various search algorithms which are described in terms of search graphs. In this context, an implicit graph may be defined as a set of rules to define all neighbors for any specified vertex.
|
| rdfs:label
| |
| skos:subject
| |
| foaf:page
| |
| is dbpprop:redirect
of | |
![[RDF Data]](/statics/sw-cube.png)
