The Profile Minimization Problem in Trees
From MaRDI portal
Recommendations
Cited in
(18)- The profile of the Cartesian product of graphs
- On the profile of the corona of two graphs
- A new matrix bandwidth reduction algorithm
- Profile minimization problem for matrices and graphs
- Divider-based algorithms for hierarchical tree partitioning.
- A variable neighborhood search and simulated annealing hybrid for the profile minimization problem
- Profile minimization on triangulated triangles
- Minimizing profile of graphs using a hybrid simulating annealing algorithm
- A tree labeling problem with an application to optimal approximation of continuous functions
- Profile minimization on compositions of graphs
- On the interval completion of chordal graphs
- Profile minimization on products of graphs
- The extended profiles of the co-trees
- The Proper Interval Colored Graph problem for caterpillar trees
- Fixed-Parameter Complexity of Minimum Profile Problems
- The tree profile problem and optimal edge labeling.
- On the proper intervalization of colored caterpillar trees
- Fixed-parameter complexity of minimum profile problems
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)