Swapping labeled tokens on graphs (Q2347003): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2008048468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3709907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic sorting in nearly logarithmic time on the hypercube and related computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs / 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: Axioms and hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2758010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting on a mesh-connected parallel computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient enumeration of all ladder lotteries and its application / rank
 
Normal rank

Revision as of 02:49, 10 July 2024

scientific article
Language Label Description Also known as
English
Swapping labeled tokens on graphs
scientific article

    Statements

    Swapping labeled tokens on graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 May 2015
    0 references
    approximation
    0 references
    complete bipartite graph
    0 references
    graph algorithm
    0 references
    sorting network
    0 references
    tree
    0 references

    Identifiers