Canadian traveller problem (Q5030897)

From Wikidata
Jump to navigation Jump to search
generalization of the shortest path problem to graphs that are partially observable
  • CTP
edit
Language Label Description Also known as
English
Canadian traveller problem
generalization of the shortest path problem to graphs that are partially observable
  • CTP

Statements

Identifiers

 
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit