A polynomial algorithm for recognizing bounded cutwidth in hypergraphs (Q5748885): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ivan Hal Sudborough / rank
Normal rank
 
Property / author
 
Property / author: Ivan Hal Sudborough / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: The vertex separation and search number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798235 / 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: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological Bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3661483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of searching a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Algorithm for Topological Bandwidth in Degree-Three Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Backboard Wiring Problem: A Placement Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for the min-cut linear arrangement of trees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:45, 21 June 2024

scientific article; zbMATH DE number 4182825
Language Label Description Also known as
English
A polynomial algorithm for recognizing bounded cutwidth in hypergraphs
scientific article; zbMATH DE number 4182825

    Statements

    A polynomial algorithm for recognizing bounded cutwidth in hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    1991
    0 references
    0 references
    0 references
    0 references
    0 references
    cutwidth
    0 references
    polynomial algorithm
    0 references
    NP-complete
    0 references