This HTML5 document contains 129 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dbpedia-dehttp://de.dbpedia.org/resource/
n23http://www.cs.utexas.edu/users/EWD/ewd05xx/
n24http://www.cs.utexas.edu/users/EWD/transcriptions/EWD05xx/
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
n9http://dbpedia.org/resource/File:
n18http://hy.dbpedia.org/resource/
foafhttp://xmlns.com/foaf/0.1/
dbpedia-kohttp://ko.dbpedia.org/resource/
dbpedia-eshttp://es.dbpedia.org/resource/
n29https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
dbpedia-srhttp://sr.dbpedia.org/resource/
n28http://www-cs-faculty.stanford.edu/~uno/
n15https://ageconsearch.umn.edu/record/272202/files/
dbpedia-fahttp://fa.dbpedia.org/resource/
n19http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbpedia-thhttp://th.dbpedia.org/resource/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Campanology
dbo:wikiPageWikiLink
dbr:Steinhaus–Johnson–Trotter_algorithm
Subject Item
dbr:List_of_algorithms
dbo:wikiPageWikiLink
dbr:Steinhaus–Johnson–Trotter_algorithm
Subject Item
dbr:Permutation
dbo:wikiPageWikiLink
dbr:Steinhaus–Johnson–Trotter_algorithm
Subject Item
dbr:Permutohedron
dbo:wikiPageWikiLink
dbr:Steinhaus–Johnson–Trotter_algorithm
Subject Item
dbr:List_of_permutation_topics
dbo:wikiPageWikiLink
dbr:Steinhaus–Johnson–Trotter_algorithm
Subject Item
dbr:Gray_code
dbo:wikiPageWikiLink
dbr:Steinhaus–Johnson–Trotter_algorithm
Subject Item
dbr:Heap's_algorithm
dbo:wikiPageWikiLink
dbr:Steinhaus–Johnson–Trotter_algorithm
Subject Item
dbr:Hale_Trotter
dbo:wikiPageWikiLink
dbr:Steinhaus–Johnson–Trotter_algorithm
dbp:knownFor
dbr:Steinhaus–Johnson–Trotter_algorithm
dbo:knownFor
dbr:Steinhaus–Johnson–Trotter_algorithm
Subject Item
dbr:Hamiltonian_path
dbo:wikiPageWikiLink
dbr:Steinhaus–Johnson–Trotter_algorithm
Subject Item
dbr:Steinhaus-Johnson-Trotter_algorithm
dbo:wikiPageWikiLink
dbr:Steinhaus–Johnson–Trotter_algorithm
dbo:wikiPageRedirects
dbr:Steinhaus–Johnson–Trotter_algorithm
Subject Item
dbr:Change_ringing
dbo:wikiPageWikiLink
dbr:Steinhaus–Johnson–Trotter_algorithm
Subject Item
dbr:Johnson–Trotter_algorithm
dbo:wikiPageWikiLink
dbr:Steinhaus–Johnson–Trotter_algorithm
dbo:wikiPageRedirects
dbr:Steinhaus–Johnson–Trotter_algorithm
Subject Item
dbr:Factorial_number_system
dbo:wikiPageWikiLink
dbr:Steinhaus–Johnson–Trotter_algorithm
Subject Item
dbr:List_of_terms_relating_to_algorithms_and_data_structures
dbo:wikiPageWikiLink
dbr:Steinhaus–Johnson–Trotter_algorithm
Subject Item
dbr:Lovász_conjecture
dbo:wikiPageWikiLink
dbr:Steinhaus–Johnson–Trotter_algorithm
Subject Item
dbr:Selmer_M._Johnson
dbo:wikiPageWikiLink
dbr:Steinhaus–Johnson–Trotter_algorithm
Subject Item
dbr:Steinhaus–Johnson–Trotter_algorithm
rdf:type
yago:PsychologicalFeature100023100 yago:Procedure101023820 dbo:Software yago:WikicatPermutations yago:Algorithm105847438 yago:Act100030358 yago:Event100029378 yago:Activity100407535 yago:Substitution107443761 yago:Abstraction100002137 yago:WikicatCombinatorialAlgorithms yago:Variation107337390 yago:Happening107283608 yago:YagoPermanentlyLocatedEntity yago:Rule105846932 yago:Change107296428
rdfs:label
스테인하우스-존슨-트로터 알고리즘 Algoritmo de Steinhaus–Johnson–Trotter Steinhaus-Johnson-Trotter-Algorithmus Steinhaus–Johnson–Trotter algorithm
rdfs: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 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 cycle in the permutohedron. Der Steinhaus-Johnson-Trotter-Algorithmus oder der Johnson-Trotter-Algorithmus, auch einfache Änderungen genannt, ist ein Algorithmus, der nach Hugo Steinhaus, Selmer M. Johnson und Hale Trotter benannt ist und alle Permutationen von Elementen erzeugt. Jede Permutation in der von ihr erzeugten Sequenz unterscheidet sich von der vorherigen Permutation durch Vertauschen zweier benachbarter Elemente der Sequenz. Entsprechend findet dieser Algorithmus einen Hamiltonweg im Permutaeder. El algoritmo Steinhaus–Johnson–Trotter o algoritmo Johnson–Trotter, también llamado cambios simples, es un algoritmo que lleva el nombre de Hugo Steinhaus Selmer M. Johnson y Hale F. Trotter que genera todas las permutaciones de n elementos. Cada permutación en la secuencia que genera difiere de la permutación anterior al intercambiar dos elementos adyacentes de la secuencia. De manera equivalente, este algoritmo encuentra un ciclo hamiltoniano en el permutoedro. El algoritmo Johnson-Trotter ofrece una forma eficaz de generar directamente permutaciones de la longitud requerida sin calcular permutaciones más cortas.​ 스테인하우스-존슨-트로터 알고리즘(Steinhaus–Johnson–Trotter algorithm) 또는 존슨-트로터 알고리즘(Johnson–Trotter algorithm)은 플레인 변경(plain changes)으로도 불리는 순열(permutohedron) 알고리즘으로 n 개 요소의 모든 순열을 생성하는 후고 스테인하우스(Hugo Steinhaus), (Selmer M. Johnson) 및 (Hale F. Trotter)의 이름을 따서 명명된 알고리즘이다. 생성하는 시퀀스의 각 순열들은 시퀀스의 인접한 두 요소를 교체하며 이전 순열과 다르다. 마찬가지로 이 알고리즘은 또한 순열(permutohedron)에서 해밀턴 경로(Hamiltonian path)주기를 찾는다.
foaf:depiction
n19:Symmetric_group_4;_Cayley_graph_1,2,6_(3D);_Steinhaus–Johnson–Trotter.svg n19:Symmetric_group_4;_permutation_list;_Steinhaus–Johnson–Trotter.svg n19:Symmetric_group_4;_permutation_list.svg n19:4.svg
dcterms:subject
dbc:Permutations dbc:Combinatorial_algorithms
dbo:wikiPageID
2568963
dbo:wikiPageRevisionID
1116241633
dbo:wikiPageWikiLink
dbr:Radix dbr:Factorial_number_system dbr:Convex_hull n9:Symmetric_group_4;_Cayley_graph_1,2,6_(3D);_Steinhaus–Johnson–Trotter.svg dbr:Iterative_method n9:Symmetric_group_4;_permutation_list;_Steinhaus–Johnson–Trotter.svg dbr:Hamiltonian_cycle dbr:Cayley_graph dbr:Hale_F._Trotter dbr:Gray_code dbr:Permutation dbr:Inversion_(discrete_mathematics) dbr:ALGOL_60 dbr:Permutohedron n9:Wheel_diagram_of_Steinhaus-Johnson-Trotter_algorithm_for_n=4.svg dbc:Permutations dbr:Change_ringing dbr:Selmer_M._Johnson dbr:Mixed_radix dbr:Truncated_octahedron dbr:Fabian_Stedman dbr:Algorithm dbr:Recursive_algorithm dbr:Heap's_algorithm dbr:Fisher–Yates_shuffle dbr:Hamiltonian_path dbr:Inverse_element dbc:Combinatorial_algorithms dbr:SIAM_Review dbr:Polytope dbr:Loopless_algorithm dbr:Parity_of_a_permutation dbr:Hugo_Steinhaus dbr:Symmetric_group dbr:Shimon_Even
dbo:wikiPageExternalLink
n15:erasmus129.pdf n23:EWD553.PDF n24:EWD502.html n28:fasc2b.ps.gz
owl:sameAs
dbpedia-sr:Steinhaus-Johnson-Trotter_algoritam dbpedia-th:ขั้นตอนวิธีของชไตน์เฮาส์_จอห์นสันและทร็อทเทอร์ dbpedia-fa:الگوریتم_استینهوس-جانسون-تروتر dbpedia-es:Algoritmo_de_Steinhaus–Johnson–Trotter n18:Շտայնհաուզ-Ջոնսոն-Թրոթթեր_ալգորիթմ freebase:m.07nm5d dbpedia-ko:스테인하우스-존슨-트로터_알고리즘 wikidata:Q4925248 n29:4ZxhG dbpedia-de:Steinhaus-Johnson-Trotter-Algorithmus
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Refend dbt:Refbegin dbt:Harvtxt dbt:Sfnp dbt:Bi dbt:OEIS2C dbt:Citation
dbo:thumbnail
n19:Symmetric_group_4;_Cayley_graph_1,2,6_(3D);_Steinhaus–Johnson–Trotter.svg?width=300
dbo:abstract
El algoritmo Steinhaus–Johnson–Trotter o algoritmo Johnson–Trotter, también llamado cambios simples, es un algoritmo que lleva el nombre de Hugo Steinhaus Selmer M. Johnson y Hale F. Trotter que genera todas las permutaciones de n elementos. Cada permutación en la secuencia que genera difiere de la permutación anterior al intercambiar dos elementos adyacentes de la secuencia. De manera equivalente, este algoritmo encuentra un ciclo hamiltoniano en el permutoedro. El algoritmo Johnson-Trotter ofrece una forma eficaz de generar directamente permutaciones de la longitud requerida sin calcular permutaciones más cortas.​ Der Steinhaus-Johnson-Trotter-Algorithmus oder der Johnson-Trotter-Algorithmus, auch einfache Änderungen genannt, ist ein Algorithmus, der nach Hugo Steinhaus, Selmer M. Johnson und Hale Trotter benannt ist und alle Permutationen von Elementen erzeugt. Jede Permutation in der von ihr erzeugten Sequenz unterscheidet sich von der vorherigen Permutation durch Vertauschen zweier benachbarter Elemente der Sequenz. Entsprechend findet dieser Algorithmus einen Hamiltonweg im Permutaeder. Diese Methode war bereits den englischen Change-Ringern des 17. Jahrhunderts bekannt und Robert Sedgewick nennt sie 1977 „den vielleicht bekanntesten Permutations-Aufzählungsalgorithmus“. Er ist nicht nur einfach und rechnerisch effizient, sondern hat auch den Vorteil, dass nachfolgende Berechnungen der von ihm erzeugten Permutationen beschleunigt werden können, da diese Permutationen einander so ähnlich sind. 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 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 cycle in the permutohedron. This method was known already to 17th-century English change ringers, and calls it "perhaps the most prominent permutation enumeration algorithm". A version of the algorithm can be implemented in such a way that the average time per permutation is constant. As well as being simple and computationally efficient, this algorithm has the advantage that subsequent computations on the permutations that it generates may be sped up because of the similarity between consecutive permutations that it generates. 스테인하우스-존슨-트로터 알고리즘(Steinhaus–Johnson–Trotter algorithm) 또는 존슨-트로터 알고리즘(Johnson–Trotter algorithm)은 플레인 변경(plain changes)으로도 불리는 순열(permutohedron) 알고리즘으로 n 개 요소의 모든 순열을 생성하는 후고 스테인하우스(Hugo Steinhaus), (Selmer M. Johnson) 및 (Hale F. Trotter)의 이름을 따서 명명된 알고리즘이다. 생성하는 시퀀스의 각 순열들은 시퀀스의 인접한 두 요소를 교체하며 이전 순열과 다르다. 마찬가지로 이 알고리즘은 또한 순열(permutohedron)에서 해밀턴 경로(Hamiltonian path)주기를 찾는다.
gold:hypernym
dbr:Algorithm
prov:wasDerivedFrom
wikipedia-en:Steinhaus–Johnson–Trotter_algorithm?oldid=1116241633&ns=0
dbo:wikiPageLength
20305
foaf:isPrimaryTopicOf
wikipedia-en:Steinhaus–Johnson–Trotter_algorithm
Subject Item
dbr:Steinhaus-Johnson-Trotter
dbo:wikiPageWikiLink
dbr:Steinhaus–Johnson–Trotter_algorithm
dbo:wikiPageRedirects
dbr:Steinhaus–Johnson–Trotter_algorithm
Subject Item
dbr:Johnson-Trotter
dbo:wikiPageWikiLink
dbr:Steinhaus–Johnson–Trotter_algorithm
dbo:wikiPageRedirects
dbr:Steinhaus–Johnson–Trotter_algorithm
Subject Item
dbr:Johnson-Trotter_algorithm
dbo:wikiPageWikiLink
dbr:Steinhaus–Johnson–Trotter_algorithm
dbo:wikiPageRedirects
dbr:Steinhaus–Johnson–Trotter_algorithm
Subject Item
dbr:Johnson–Trotter
dbo:wikiPageWikiLink
dbr:Steinhaus–Johnson–Trotter_algorithm
dbo:wikiPageRedirects
dbr:Steinhaus–Johnson–Trotter_algorithm
Subject Item
dbr:Plain_changes
dbo:wikiPageWikiLink
dbr:Steinhaus–Johnson–Trotter_algorithm
dbo:wikiPageRedirects
dbr:Steinhaus–Johnson–Trotter_algorithm
Subject Item
wikipedia-en:Steinhaus–Johnson–Trotter_algorithm
foaf:primaryTopic
dbr:Steinhaus–Johnson–Trotter_algorithm