On the Cutwidth and the Topological Bandwidth of a Tree (Q3679205): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2097333141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bandwidth problem for graphs and matrices—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3921277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / 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: Q4103547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological Bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of the bandwidth minimization problem / rank
 
Normal rank

Latest revision as of 16:45, 14 June 2024

scientific article
Language Label Description Also known as
English
On the Cutwidth and the Topological Bandwidth of a Tree
scientific article

    Statements

    On the Cutwidth and the Topological Bandwidth of a Tree (English)
    0 references
    1985
    0 references
    numbering
    0 references
    linear arrangement
    0 references
    bandwidth
    0 references
    topological bandwidth
    0 references
    cutwidth
    0 references
    tree
    0 references
    0 references

    Identifiers