Combinatorial Algorithms for Listing Paths in Minimal Change Order

DOI10.1007/978-3-540-77294-1_11zbMATH Open1136.68616OpenAlexW1558918557MaRDI QIDQ5458510FDOQ5458510

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

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

zbMATH Keywords

Complete graphCombinatorial algorithmsGeneration of pathsMinimal change orderRevolving door order

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A Survey of Combinatorial Gray Codes
• Generation of Permutations by Adjacent Transposition
• Computing and Combinatorics
• A loopless Gray code for rooted trees
• An algorithm for generating permutations
• Generation of Rosary permutations expressed in Hamiltonian circuits

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)