Topological Bandwidth (Q3691781): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/0606044 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4248251133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674871 / 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: On the Cutwidth and the Topological Bandwidth of a Tree / 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: Complexity Results for Bandwidth Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-white pebbles and graph separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On eliminating nondeterminism from Turing machines which use less than logarithm worktape space / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-dimensional logic gate assignment and interval graphs / 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: On arithmetic expressions and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth and pebbling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth constraints on problems complete for polynomial time / rank
 
Normal rank

Latest revision as of 17:41, 14 June 2024

scientific article
Language Label Description Also known as
English
Topological Bandwidth
scientific article

    Statements

    Topological Bandwidth (English)
    0 references
    0 references
    0 references
    1985
    0 references
    NP-completeness
    0 references
    topological bandwidth
    0 references
    cutwidth
    0 references
    Linear Arrangement
    0 references

    Identifiers

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