Profile minimization on compositions of graphs
From MaRDI portal
Publication:2471064
Recommendations
Cites work
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- Algorithms for reducing the bandwidth and profile of a sparse matrix
- Algorithms for the reduction of matrix bandwidth and profile
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
- Bandwidths and profiles of trees
- Domination-balanced graphs
- Exact profile values of some graph compositions
- Graph searching and interval completion
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 640516 (Why is no real title available?)
- scientific article; zbMATH DE number 1156610 (Why is no real title available?)
- scientific article; zbMATH DE number 943290 (Why is no real title available?)
- Profile minimization problem for matrices and graphs
- The Profile Minimization Problem in Trees
Cited in
(14)- Profile minimization problem for matrices and graphs
- Exact profile values of some graph compositions
- Profile minimization on triangulated triangles
- Minimizing profile of graphs using a hybrid simulating annealing algorithm
- Profile minimization on products of graphs
- Compositions constrained by graph Laplacian minors
- The extended profiles of the co-trees
- The interval graph completion problem for the complete multipartite graphs
- Fixed-Parameter Complexity of Minimum Profile Problems
- The Profile Minimization Problem in Trees
- scientific article; zbMATH DE number 640516 (Why is no real title available?)
- scientific article; zbMATH DE number 943290 (Why is no real title available?)
- Recognizing triangulated Cartesian graph products
- Fixed-parameter complexity of minimum profile problems
This page was built for publication: Profile minimization on compositions of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2471064)