The Profile Minimization Problem in Trees
From MaRDI portal
Publication:4286229
DOI10.1137/S009753979119607XzbMath0794.05117MaRDI QIDQ4286229
No author found.
Publication date: 18 August 1994
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (10)
A variable neighborhood search and simulated annealing hybrid for the profile minimization problem ⋮ Divider-based algorithms for hierarchical tree partitioning. ⋮ Profile minimization on compositions of graphs ⋮ On the interval completion of chordal graphs ⋮ Profile minimization on products of graphs ⋮ The profile of the Cartesian product of graphs ⋮ On the profile of the corona of two graphs ⋮ On the proper intervalization of colored caterpillar trees ⋮ A new matrix bandwidth reduction algorithm ⋮ The Proper Interval Colored Graph problem for caterpillar trees
This page was built for publication: The Profile Minimization Problem in Trees
