On bandwidth, cutwidth, and quotient graphs (Q4359287): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Congestion optimale du plongement de l’hypercube $H (n)$ dans la chaîne $P(2^n)$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668821 / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of Several Bandwidth and Profile Reduction Algorithms / 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: Optimal Assignments of Numbers to Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal numberings and isoperimetric problems on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Placement of the processors of a hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3477932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of the bandwidth minimization problem / rank
 
Normal rank

Latest revision as of 18:22, 27 May 2024

scientific article; zbMATH DE number 1072395
Language Label Description Also known as
English
On bandwidth, cutwidth, and quotient graphs
scientific article; zbMATH DE number 1072395

    Statements

    Identifiers