Combinatorial Algorithms for Listing Paths in Minimal Change Order

DOI10.1007/978-3-540-77294-1_11MaRDI QIDQ5458510zbMATH OpenOpenAlexFDO

Authors Zareen Alamgir, Sarmad Abbasi

Publication date 15 April 2008

Published in Combinatorial and Algorithmic Aspects of Networking (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77294-1_11

zbMATH Keywords

Combinatorial algorithmsComplete graphGeneration of pathsMinimal change orderRevolving door order

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 3926235
• On the complexity of recursive path orderings
• Efficient Algorithms for Listing Combinatorial Structures
• Efficient Algorithms for Listing Combinatorial Structures
• Some Hamilton Paths and a Minimal Change Algorithm
• Enumerating minimal length lattice paths
• Efficient algorithms for listing \(k\) disjoint \(st\)-paths in graphs
• Incremental algorithms for minimal length paths
• Efficiently listing bounded length \(st\)-paths

Cites work

• A loopless Gray code for rooted trees
• A Survey of Combinatorial Gray Codes
• An algorithm for generating permutations
• Computing and Combinatorics
• Generation of Permutations by Adjacent Transposition
• Generation of Rosary permutations expressed in Hamiltonian circuits
• scientific article; zbMATH DE number 3748431 (Why is no real title available?)
• scientific article; zbMATH DE number 2176112 (Why is no real title available?)

Cited in

(1)

• Some Hamilton Paths and a Minimal Change Algorithm

This page was built for publication: Combinatorial Algorithms for Listing Paths in Minimal Change Order

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