Clifford algebra method for network expression, computation, and algorithm construction

DOI10.1002/mma.2904zbMath1291.90213OpenAlexW1991094624MaRDI QIDQ5170222

Zhaoyuan Yu, Yong Hu, Wen Luo, Linwang Yuan, Jiyi Zhang

Publication date: 22 July 2014

Published in: Mathematical Methods in the Applied Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/mma.2904

zbMATH Keywords

Clifford algebranetwork analysisshortest path algorithmalgorithm construction

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Clifford algebras, spinors (15A66) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Generalized zeon algebras: theory and application to multi-constrained path problems ⋮ Mvtree for hierarchical network representation based on geometric algebra subspace

Uses Software

• KamiWaAi

Cites Work

• Finding the shortest paths by node combination
• The class of Clifford-Fourier transforms
• Clifford algebra-parametrized octonions and generalizations
• A DNA procedure for solving the shortest path problem
• An improved Dijkstra's shortest path algorithm for sparse network
• Reductions in computational complexity using Clifford algebras
• A new adjacency matrix for finite graphs
• Spinor representations of Clifford algebras: A symbolic approach
• Balancing minimum spanning trees and shortest-path trees
• Nonlinear neural networks for solving the shortest path problem
• A new algorithm for the discrete fuzzy shortest path problem in a network
• Clifford algebras and representations of complex orthogonal groups
• Models and algorithm for stochastic shortest path problem
• Gaalop—High Performance Parallel Computing Based on Conformal Geometric Algebra
• Unnamed Item

This page was built for publication: Clifford algebra method for network expression, computation, and algorithm construction