Characterization of diagrams by 0-1 inequalities (Q1092920): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On a Probabilistic Graph-Theoretical Method / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3291034 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3222890 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Characterization of diagrams by 0-1 inequalities / rank | |||
Normal rank | |||
Latest revision as of 12:47, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Characterization of diagrams by 0-1 inequalities |
scientific article |
Statements
Characterization of diagrams by 0-1 inequalities (English)
0 references
1987
0 references
The existence of an orientation of a graph G such that the resulting directed graph is a covering graph of an order is reduced to solving a system of 0-1 inequalities and, the author says, this approach opens up the possibility of applying some of the techniques developed in 0-1 optimization to the diagram problem.
0 references
orientation
0 references
directed graph
0 references
0-1 inequalities
0 references
diagram
0 references
