Linear arrangement problems on recursively partitioned graphs (Q3778551): 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.1007/bf01928924 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979073798 / rank
 
Normal rank

Latest revision as of 11:30, 30 July 2024

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
    0 references
    1988
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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
    0 references