On the Diameter of the Pancake Network

From MaRDI portal
Revision as of 23:25, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4366875

DOI10.1006/jagm.1997.0874zbMath0888.68007DBLPjournals/jal/HeydariS97OpenAlexW2025402252WikidataQ56287387 ScholiaQ56287387MaRDI QIDQ4366875

Mohammad Heydari, Ivan Hal Sudborough

Publication date: 1 June 1998

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1997.0874




Related Items (34)

The spectral gap of graphs arising from substring reversalsA NOTE ON COMPLEXITY OF GENETIC MUTATIONSGroupoid Action and Rearrangement Problem of Bicolor Arrays by Prefix ReversalsGreedy flipping of pancakes and burnt pancakesAn \((18/11)n\) upper bound for sorting by prefix reversalsEdge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault modelSpectra and eigenspaces from regular partitions of Cayley (di)graphs of permutation groupsOn the Hardness of Optimal Vertex Relabeling and Restricted Vertex RelabelingA quadratic lower bound for topswopsPhysical zero-knowledge proof protocol for TopswopsAutomorphism groups of the Pancake graphsSuccessor rules for flipping pancakes and burnt pancakesOn average and highest number of flips in pancake sortingHamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimalityBlock Sorting is HardSorting by prefix reversals and prefix transpositionsPancake flipping and sorting permutationsShort proofs for cut-and-paste sorting of permutationsPancake flipping is hardSome problems on Cayley graphsSorting permutations and binary strings by length-weighted rearrangementsOn Some Structural Properties of Star and Pancake GraphsCycles in the burnt pancake graphThe super connectivity of the pancake graphs and the super laceability of the star graphsSome relations on prefix reversal generators of the symmetric and hyperoctahedral groupA quadratic time 2-approximation algorithm for block sortingRing embedding in faulty pancake graphsVertex reconstruction in Cayley graphsAn Audit Tool for Genome Rearrangement AlgorithmsBounding prefix transposition distance for strings and permutationsSurvey on path and cycle embedding in some networksA new general family of mixed graphsMutually independent Hamiltonian cycles for the pancake graphs and the star graphsA Hamilton cycle in the \(k\)-sided pancake network






This page was built for publication: On the Diameter of the Pancake Network