Linear arrangement problems on recursively partitioned graphs (Q3778551)

From MaRDI portal
Revision as of 01:58, 19 October 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
Linear arrangement problems on recursively partitioned graphs
scientific article

    Statements

    Linear arrangement problems on recursively partitioned graphs (English)
    0 references
    0 references
    0 references
    1988
    0 references
    restrictions of linear arrangement problems
    0 references
    binary tree
    0 references
    p-tree
    0 references
    circuit layout systems
    0 references
    polynomial time
    0 references
    NP-complete
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references