Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures (Q1422414)

From MaRDI portal
Revision as of 21:40, 20 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
scientific article

    Statements

    Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures (English)
    0 references
    0 references
    0 references
    14 February 2004
    0 references
    Graph
    0 references
    Conjecture
    0 references
    Automated system
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references