Existence and construction of Hamiltonian paths and cycles on conforming tetrahedral meshes

DOI10.1080/00207160.2010.496850MaRDI QIDQ2995505zbMATH OpenOpenAlexFDO

Authors Hui Liu, Linbo Zhang

Publication date 21 April 2011

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160.2010.496850

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Graph algorithms (graph-theoretic aspects) (05C85) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Parallel numerical computation (65Y05) Parallel algorithms in computer science (68W10)

Recommendations

• Parallel construction of Hamiltonian paths for conforming tetrahedral meshes
• An efficient algorithm for constructing Hamiltonian paths in meshes
• Hamiltonian tetrahedralizations with Steiner points
• Hamiltonian cycles in polyhedral maps
• The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle.

Cites work

• Dynamic load balancing in computational mechanics
• NETGEN: An advancing front 2D/3D-mesh generator based on abstract rules
• New challenges in dynamic load balancing

Cited in

(5)

• An efficient algorithm for constructing Hamiltonian paths in meshes
• Hamiltonian triangular refinements and space-filling curves
• Hamiltonian tetrahedralizations with Steiner points
• Parallel construction of Hamiltonian paths for conforming tetrahedral meshes
• The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle.

Describes a project that uses

Uses Software

• Netgen

This page was built for publication: Existence and construction of Hamiltonian paths and cycles on conforming tetrahedral meshes

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