DBpedia – Linked Data Fragments

Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Steinhaus–Johnson–Trotter_algorithm> ?p ?o }

• Steinhaus–Johnson–Trotter_algorithm abstract "The Steinhaus–Johnson–Trotter algorithm or Johnson–Trotter algorithm, also called plain changes, is an algorithm named after Hugo Steinhaus, Selmer M. Johnson and Hale F. Trotter that generates all of the permutations of n elements. Each permutation in the sequence that it generates differs from the previous permutation by swapping two adjacent elements of the sequence. Equivalently, this algorithm finds a Hamiltonian path in the permutohedron.This method was known already to 17th-century English change ringers, and Sedgewick (1977) calls it \"perhaps the most prominent permutation enumeration algorithm\". As well as being simple and computationally efficient, it has the advantage that subsequent computations on the permutations that it generates may be sped up because these permutations are so similar to each other.".
• Steinhaus–Johnson–Trotter_algorithm thumbnail Steinhaus-Johnson-Trotter-Permutohedron.svg?width=300.
• Steinhaus–Johnson–Trotter_algorithm wikiPageExternalLink fasc2b.ps.gz.
• Steinhaus–Johnson–Trotter_algorithm wikiPageExternalLink EWD553.PDF.
• Steinhaus–Johnson–Trotter_algorithm wikiPageExternalLink EWD502.html.
• Steinhaus–Johnson–Trotter_algorithm wikiPageExternalLink JohnsonTrotter.shtml.
• Steinhaus–Johnson–Trotter_algorithm wikiPageExternalLink files.
• Steinhaus–Johnson–Trotter_algorithm wikiPageID "2568963".
• Steinhaus–Johnson–Trotter_algorithm wikiPageLength "17018".
• Steinhaus–Johnson–Trotter_algorithm wikiPageOutDegree "48".
• Steinhaus–Johnson–Trotter_algorithm wikiPageRevisionID "662333702".
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Algorithm.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Category:Combinatorial_algorithms.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Category:Permutations.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Cayley_graph.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Change_ringing.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Convex_hull.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Cut-the-Knot.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Fabian_Stedman.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Factorial_number_system.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Gray_code.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Hale_F._Trotter.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Hamiltonian_path.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Heaps_algorithm.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Hugo_Steinhaus.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Inverse_element.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Inverse_function.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Inversion_(discrete_mathematics).
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Loopless_algorithm.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Mixed_radix.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Parity_of_a_permutation.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Permutation.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Permutohedron.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Polytope.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Pseudocode.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Radix.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Recursion_(computer_science).
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Selmer_M._Johnson.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Shimon_Even.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Society_for_Industrial_and_Applied_Mathematics.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink SourceForge.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Symmetric_group.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink The_Art_of_Computer_Programming.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink Truncated_octahedron.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink File:Steinhaus-Johnson-Trotter-Permutohedron.svg.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink File:Symmetric_group_4;_Cayley_graph_1,2,6_(3D);_Steinhaus–Johnson–Trotter.svg.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink File:Symmetric_group_4;_permutation_list;_Steinhaus–Johnson–Trotter_Cayley_graph.svg.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink File:Symmetric_group_4;_permutation_list;_Steinhaus–Johnson–Trotter_permutohedron.svg.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink File:Symmetric_group_4;_permutation_list_with_matrices.svg.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLink File:Symmetric_group_4;_permutohedron_3D;_permutations_and_inversion_vectors;_Steinhaus–Johnson–Trotter.svg.
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLinkText "Johnson–Trotter algorithm".
• Steinhaus–Johnson–Trotter_algorithm wikiPageWikiLinkText "Steinhaus–Johnson–Trotter algorithm".
• Steinhaus–Johnson–Trotter_algorithm wikiPageUsesTemplate Template:Citation.
• Steinhaus–Johnson–Trotter_algorithm wikiPageUsesTemplate Template:Citeseerx.
• Steinhaus–Johnson–Trotter_algorithm wikiPageUsesTemplate Template:Harvtxt.
• Steinhaus–Johnson–Trotter_algorithm wikiPageUsesTemplate Template:Refbegin.
• Steinhaus–Johnson–Trotter_algorithm wikiPageUsesTemplate Template:Refend.
• Steinhaus–Johnson–Trotter_algorithm wikiPageUsesTemplate Template:Reflist.
• Steinhaus–Johnson–Trotter_algorithm subject Category:Combinatorial_algorithms.
• Steinhaus–Johnson–Trotter_algorithm subject Category:Permutations.
• Steinhaus–Johnson–Trotter_algorithm hypernym Algorithm.
• Steinhaus–Johnson–Trotter_algorithm type Software.
• Steinhaus–Johnson–Trotter_algorithm type Algorithm.
• Steinhaus–Johnson–Trotter_algorithm type Combinatoric.
• Steinhaus–Johnson–Trotter_algorithm type Function.
• Steinhaus–Johnson–Trotter_algorithm type Redirect.
• Steinhaus–Johnson–Trotter_algorithm comment "The Steinhaus–Johnson–Trotter algorithm or Johnson–Trotter algorithm, also called plain changes, is an algorithm named after Hugo Steinhaus, Selmer M. Johnson and Hale F. Trotter that generates all of the permutations of n elements. Each permutation in the sequence that it generates differs from the previous permutation by swapping two adjacent elements of the sequence.".
• Steinhaus–Johnson–Trotter_algorithm label "Steinhaus–Johnson–Trotter algorithm".
• Steinhaus–Johnson–Trotter_algorithm sameAs Q4925248.
• Steinhaus–Johnson–Trotter_algorithm sameAs Շտայնհաուզ-Ջոնսոն-Թրոթթեր_ալգորիթմ.
• Steinhaus–Johnson–Trotter_algorithm sameAs m.07nm5d.
• Steinhaus–Johnson–Trotter_algorithm sameAs Steinhaus-Johnson-Trotter_algoritam.
• Steinhaus–Johnson–Trotter_algorithm sameAs ขั้นตอนวิธีของชไตน์เฮาส์_จอห์นสันและทร็อทเทอร์.
• Steinhaus–Johnson–Trotter_algorithm sameAs Q4925248.
• Steinhaus–Johnson–Trotter_algorithm wasDerivedFrom Steinhaus–Johnson–Trotter_algorithm?oldid=662333702.
• Steinhaus–Johnson–Trotter_algorithm depiction Steinhaus-Johnson-Trotter-Permutohedron.svg.
• Steinhaus–Johnson–Trotter_algorithm isPrimaryTopicOf Steinhaus–Johnson–Trotter_algorithm.