Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming (Q1764795): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CPLEX / rank | |||
Normal rank | |||
Revision as of 22:21, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming |
scientific article |
Statements
Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming (English)
0 references
22 February 2005
0 references
Algorithms
0 references
Directed acyclic graph
0 references
Network generator
0 references
Constraint logic programming
0 references
Complexity index
0 references
