The kissing problem: how to end a gathering when everyone kisses everyone else goodbye (Q489765): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Rendezvous search on labeled networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rendezvous search on a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the Geometric Covering Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of oblivious robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic rendezvous in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering of asynchronous robots with limited visibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordination without communication: the case of the flocking problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4948735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4794459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4515633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to meet in anonymous network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bitonic Sort on a Mesh-Connected Parallel Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \((n^ 2-1)\)-puzzle and related relocation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel sorting in two-dimensional VLSI models of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing fair round robin tournaments with a minimum number of breaks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph puzzles, homotopy, and the alternating group / rank
 
Normal rank

Latest revision as of 13:41, 9 July 2024

scientific article
Language Label Description Also known as
English
The kissing problem: how to end a gathering when everyone kisses everyone else goodbye
scientific article

    Statements

    The kissing problem: how to end a gathering when everyone kisses everyone else goodbye (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 January 2015
    0 references
    0 references
    algorithms
    0 references
    kissing problem
    0 references
    block sliding
    0 references
    approximation algorithms
    0 references
    routing
    0 references
    communication
    0 references
    0 references