Swapping Colored Tokens on Graphs (Q3449858): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Planar 3DM is NP-complete / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of finding minimum-length generator sequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4344097 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial optimization. Theory and algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and \(k\)-ary trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Swapping labeled tokens on graphs / rank | |||
Normal rank |
Latest revision as of 23:26, 10 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Swapping Colored Tokens on Graphs |
scientific article |
Statements
Swapping Colored Tokens on Graphs (English)
0 references
30 October 2015
0 references