Transposition Graphs

DOI10.1137/0202011MaRDI QIDQ5680157zbMATH OpenOpenAlexFDO

Authors Philip J. Chase

Publication date 1973

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0202011

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Extremal problems in graph theory (05C35) Graph theory (05C99)

Cited in

(9)

• Gray codes with restricted density
• A method to solve conditional optimization problems with quadratic objective functions on the set of permutations
• On the benefits and risks of using fitness sharing for multimodal optimisation
• Disjoint Hamilton cycles in transposition graphs
• On realization graphs of degree sequences
• Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs
• scientific article; zbMATH DE number 706769 (Why is no real title available?)
• Efficient computation of statistical procedures based on all subsets of a specified size
• The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks

This page was built for publication: Transposition Graphs

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