Combinatorial Algorithms for Listing Paths in Minimal Change Order

DOI10.1007/978-3-540-77294-1_11zbMath1136.68616OpenAlexW1558918557MaRDI QIDQ5458510

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

Complete graphCombinatorial algorithmsGeneration of pathsMinimal change orderRevolving door order

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• A loopless Gray code for rooted trees
• A Survey of Combinatorial Gray Codes
• An algorithm for generating permutations
• Generation of Rosary permutations expressed in Hamiltonian circuits
• Computing and Combinatorics
• Generation of Permutations by Adjacent Transposition

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