Finding \(k\) shortest paths in Cayley graphs of finite groups

DOI10.1007/S00373-024-02852-YMaRDI QIDQ6640962

Do Han Kim

Publication date: 20 November 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

Cayley graphfinite groupstring rewriting system\(k\) shortest path

Mathematics Subject Classification ID

Could not fetch data.

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The number of shortest paths in the arrangement graph
• Construction of defining relators for finite groups
• On the number of reduced decompositions of elements of Coxeter groups
• Fundamental algorithms for permutation groups
• Processor interconnection networks from Cayley graphs
• Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and \(k\)-ary trees
• Rewriting systems of Coxeter groups
• Low time complexity algorithms for path computation in Cayley graphs
• There is no optimal routing policy for the torus.
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• Sorting on graphs by adjacent swaps using permutation groups
• Introduction to algorithms
• The number of shortest paths in the (n, k)-star graph
• Combinatorics of Coxeter Groups
• A group-theoretic model for symmetric interconnection networks
• Implementation and Analysis of the Todd-Coxeter Algorithm
• Finite complete rewriting systems for groups
• Geodesic rewriting systems and pregroups
• Presentations of groups generated by transpositions

This page was built for publication: Finding \(k\) shortest paths in Cayley graphs of finite groups

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