Algebraic graph theory for ordering

DOI10.1016/0045-7949(90)90196-9MaRDI QIDQ4713689zbMATH OpenOpenAlexFDO

Authors A. Kaveh

Publication date 25 June 1992

Published in Computers & Structures (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0045-7949(90)90196-9

zbMATH Keywords

nodal numberingshortest route treetransversal

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Programming involving graphs or networks (90C35)

Recommendations

• A multi-level finite element nodal ordering using algebraic graph theory
• scientific article; zbMATH DE number 27961
• Ordering for bandwidth reduction
• A novel nodal ordering algorithm for profile optimization by efficient solution of a differential equation

Cited in

(6)

• Constructing order type graphs using an axiomatic approach
• A novel nodal ordering algorithm for profile optimization by efficient solution of a differential equation
• scientific article; zbMATH DE number 27961 (Why is no real title available?)
• A connectivity coordinate system for node and element ordering
• A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph
• A multi-level finite element nodal ordering using algebraic graph theory

This page was built for publication: Algebraic graph theory for ordering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4713689)