Primal graph: Difference between revisions
Content deleted Content added
m Removed category "Graphs as models of other objects"; Quick-adding category "Graphs" (using HotCat) |
No edit summary |
||
| Line 1: | Line 1: | ||
| ⚫ | |||
{{unreferenced|date=June 2008}} |
|||
| ⚫ | |||
*[[Primal graph (hypergraphs)]] of a [[hypergraph]] |
|||
A '''primal graph''' of a [[hypergraph]] is a [[Graph (mathematics)|graph]] with the same vertices of the hypergraph, and an edge between any pair of vertices contained in the same [[hyperedge]]. |
|||
| ⚫ | |||
*[[Primal constraint graph]] |
|||
{{disambig}} |
|||
| ⚫ | |||
In [[constraint satisfaction]], the primal graph or '''primal constraint graph''' of a [[constraint satisfaction problem]] is the graph whose nodes are the variables of the problem and an edge joins a pair of variables if the two variables occur together in a constraint. The primal graph of a constraint satisfaction problem can also be defined as the primal graph of the hypergraph made of the variables and the constraint scopes. In the case of binary constraint network any two nodes having missing arcs between each other means these two nodes have the universal binary relation between each pair of values. |
|||
{{combin-stub}} |
|||
[[Category:Constraint satisfaction]] |
|||
[[Category:Graphs]] |
|||
Revision as of 17:58, 10 October 2008
Primal graph may be used in several meanings.
- Primal graph (hypergraphs) of a hypergraph
- A primal graph may be the planar graph from which a dual graph is formed.
- Primal constraint graph
This disambiguation page lists articles associated with the title Primal graph.
If an internal link led you here, you may wish to change the link to point directly to the intended article.
If an internal link led you here, you may wish to change the link to point directly to the intended article.