Combinatorial optimization of special graphs for nodal ordering and graph partitioning
From MaRDI portal
Publication:731499
DOI10.1007/S00707-008-0107-6zbMATH Open1172.74052OpenAlexW1986499156MaRDI QIDQ731499FDOQ731499
Authors: K. Koohestani, A. Kaveh 
Publication date: 8 October 2009
Published in: Acta Mechanica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00707-008-0107-6
Recommendations
- scientific article; zbMATH DE number 5761786
- Partitioning ordered hypergraphs
- Path optimization for graph partitioning problems
- Efficient polynomial-time algorithms for special graph partitioning problems
- The node capacitated graph partitioning problem: A computational study
- Cyclic and linear graph partitions and normal ordering
- Optimal vertex ordering of graphs
- scientific article; zbMATH DE number 2159270
- Combinatorial optimization and graph algorithms. Communications of NII Shonan meetings
- Graph and hypergraph partitioning
Applications of graph theory (05C90) Optimization problems in solid mechanics (74P99) Thin bodies, structures (74K99)
Cites Work
- Title not available (Why is that?)
- Block diagonalization of adjacency and Laplacian matrices for graph product; applications in structural mechanics
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Title not available (Why is that?)
- Node and element resequencing using the Laplacian of a finite element graph: Part I—General concepts and algorithm
- Optimal structural analysis
- Eigenvalues of factorable matrices with form IV symmetry
- Eigensolutions for matrices of special structures
- A spectral algorithm for envelope reduction of sparse matrices
- Compound matrix block diagonalization for efficient solution of eigenproblems in structural mechanics
- A multi-level finite element nodal ordering using algebraic graph theory
- Transportation in graphs and the admittance spectrum
- A block QR algorithm and the singular value decomposition
- Convergence analysis of the block Householder diagonalization algorithm
- A New Algorithm for Finding a Pseudoperipheral Node in a Graph
- Linear Algebra in Geography: Eigenvectors of Networks
- Efficient diagonalization of oversized matrices on a distributed-memory multiprocessor
Cited In (9)
- Eigensolution of rotationally repetitive space structures using a canonical form
- Exploitation of symmetry in graphs with applications to finite and boundary elements analysis
- Efficient free vibration analysis of rotationally symmetric shell structures
- On the decomposition of generalized eigenproblems for the free vibration analysis of cyclically symmetric finite element models
- Topology and graph products; eigenproblems in optimal structural analysis
- An orthogonal self-stress matrix for efficient analysis of cyclically symmetric space truss structures via force method
- A novel nodal ordering algorithm for profile optimization by efficient solution of a differential equation
- Block diagonalization of Laplacian matrices of symmetric graphs via group theory
- A multi-level finite element nodal ordering using algebraic graph theory
This page was built for publication: Combinatorial optimization of special graphs for nodal ordering and graph partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q731499)
