Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming (Q1764795)

From MaRDI portal
Revision as of 10:40, 20 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q647536)
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
    0 references
    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

    Identifiers