Profile minimization problem for matrices and graphs
From MaRDI portal
Publication:1327828
DOI10.1007/BF02006264zbMath0804.05060OpenAlexW1966632753MaRDI QIDQ1327828
Publication date: 29 June 1994
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02006264
Trees (05C05) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (16)
An integer programming model for the Minimum Interval Graph Completion Problem ⋮ Algorithms and Bounds for L-Drawings of Directed Graphs ⋮ Partitioning and Reordering for Spike-Based Distributed-Memory Parallel Gauss--Seidel ⋮ A variable neighborhood search and simulated annealing hybrid for the profile minimization problem ⋮ Optimal labelling of unit interval graphs ⋮ Deep two-way matrix reordering for relational data analysis ⋮ A Hypergraph Partitioning Model for Profile Minimization ⋮ Profile minimization on compositions of graphs ⋮ An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method ⋮ Fixed-parameter complexity of minimum profile problems ⋮ Profile minimization on products of graphs ⋮ An evaluation of low-cost heuristics for matrix bandwidth and profile reductions ⋮ Parameterizing above or below guaranteed values ⋮ The profile of the Cartesian product of graphs ⋮ On the profile of the corona of two graphs ⋮ Addressing the envelope reduction of sparse matrices using a genetic programming system
Cites Work
This page was built for publication: Profile minimization problem for matrices and graphs
