A variation on the min cut linear arrangement problem (Q3785979): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Linear Ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: On optimal linear arrangements of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Bandwidth Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost Trade-offs in Graph Embeddings, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs That are Almost Binary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Planar Separator Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological Bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of searching a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3725545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of the bandwidth minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3208679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimum Linear Arrangement Algorithm for Undirected Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: White pebbles help / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for the min-cut linear arrangement of trees / rank
 
Normal rank

Latest revision as of 17:04, 18 June 2024

scientific article
Language Label Description Also known as
English
A variation on the min cut linear arrangement problem
scientific article

    Statements

    A variation on the min cut linear arrangement problem (English)
    0 references
    0 references
    0 references
    1987
    0 references
    0 references
    0 references
    0 references
    0 references
    embedding outerplanar graphs into spanning tree
    0 references
    min cut linear arrangement problem
    0 references
    NP-complete
    0 references
    linear-time algorithm
    0 references
    approximation algorithm
    0 references