On Complete S-Reachable Graphs (Q5069738): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimal pebble motion on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON <i>mRJ</i> REACHABILITY IN TREES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling and solving English peg solitaire / 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: Feasibility of Motion Planning on Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility of motion planning on acyclic and strongly connected directed graphs / rank
 
Normal rank

Latest revision as of 17:10, 28 July 2024

scientific article; zbMATH DE number 7509075
Language Label Description Also known as
English
On Complete S-Reachable Graphs
scientific article; zbMATH DE number 7509075

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references