Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming (Q1764795)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming |
scientific article; zbMATH DE number 2136932
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming |
scientific article; zbMATH DE number 2136932 |
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
0.7738317251205444
0 references
0.7026528716087341
0 references
0.6943195462226868
0 references
0.6893545985221863
0 references
