The Profile Minimization Problem in Trees
From MaRDI portal
Publication:4286229
DOI10.1137/S009753979119607XzbMATH Open0794.05117MaRDI QIDQ4286229FDOQ4286229
Authors:
Publication date: 18 August 1994
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Recommendations
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cited In (18)
- A tree labeling problem with an application to optimal approximation of continuous functions
- Divider-based algorithms for hierarchical tree partitioning.
- Profile minimization on compositions of graphs
- Profile minimization on products of graphs
- Fixed-parameter complexity of minimum profile problems
- A new matrix bandwidth reduction algorithm
- The extended profiles of the co-trees
- Profile minimization problem for matrices and graphs
- A variable neighborhood search and simulated annealing hybrid for the profile minimization problem
- On the interval completion of chordal graphs
- The tree profile problem and optimal edge labeling.
- Profile minimization on triangulated triangles
- On the proper intervalization of colored caterpillar trees
- The Proper Interval Colored Graph problem for caterpillar trees
- Minimizing profile of graphs using a hybrid simulating annealing algorithm
- Fixed-Parameter Complexity of Minimum Profile Problems
- The profile of the Cartesian product of graphs
- On the profile of the corona of two graphs
This page was built for publication: The Profile Minimization Problem in Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286229)
