Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming (Q1764795): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s1567-8326(03)00057-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1980322379 / rank | |||
Normal rank | |||
Latest revision as of 12:04, 30 July 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
0 references
0 references
0 references
