Matches in SemOpenAlex for { <https://semopenalex.org/work/W4288025187> ?p ?o ?g. }
Showing items 1 to 60 of
60
with 100 items per page.
- W4288025187 abstract "The determination of the computational complexity of multi-agent pathfinding on directed graphs has been an open problem for many years. For undirected graphs, solvability can be decided in polynomial time, as has been shown already in the eighties. Further, recently it has been shown that a special case on directed graphs is solvable in polynomial time. In this paper, we show that the problem is NP-hard in the general case. In addition, some upper bounds are proven." @default.
- W4288025187 created "2022-07-26" @default.
- W4288025187 creator A5002446890 @default.
- W4288025187 date "2019-11-11" @default.
- W4288025187 modified "2023-09-26" @default.
- W4288025187 title "On the Computational Complexity of Multi-Agent Pathfinding on Directed Graphs" @default.
- W4288025187 doi "https://doi.org/10.48550/arxiv.1911.04871" @default.
- W4288025187 hasPublicationYear "2019" @default.
- W4288025187 type Work @default.
- W4288025187 citedByCount "0" @default.
- W4288025187 crossrefType "posted-content" @default.
- W4288025187 hasAuthorship W4288025187A5002446890 @default.
- W4288025187 hasBestOaLocation W42880251871 @default.
- W4288025187 hasConcept C11413529 @default.
- W4288025187 hasConcept C114614502 @default.
- W4288025187 hasConcept C118615104 @default.
- W4288025187 hasConcept C132525143 @default.
- W4288025187 hasConcept C134306372 @default.
- W4288025187 hasConcept C146380142 @default.
- W4288025187 hasConcept C179799912 @default.
- W4288025187 hasConcept C22590252 @default.
- W4288025187 hasConcept C25321074 @default.
- W4288025187 hasConcept C3018234147 @default.
- W4288025187 hasConcept C311688 @default.
- W4288025187 hasConcept C33923547 @default.
- W4288025187 hasConcept C41008148 @default.
- W4288025187 hasConcept C80444323 @default.
- W4288025187 hasConcept C90119067 @default.
- W4288025187 hasConceptScore W4288025187C11413529 @default.
- W4288025187 hasConceptScore W4288025187C114614502 @default.
- W4288025187 hasConceptScore W4288025187C118615104 @default.
- W4288025187 hasConceptScore W4288025187C132525143 @default.
- W4288025187 hasConceptScore W4288025187C134306372 @default.
- W4288025187 hasConceptScore W4288025187C146380142 @default.
- W4288025187 hasConceptScore W4288025187C179799912 @default.
- W4288025187 hasConceptScore W4288025187C22590252 @default.
- W4288025187 hasConceptScore W4288025187C25321074 @default.
- W4288025187 hasConceptScore W4288025187C3018234147 @default.
- W4288025187 hasConceptScore W4288025187C311688 @default.
- W4288025187 hasConceptScore W4288025187C33923547 @default.
- W4288025187 hasConceptScore W4288025187C41008148 @default.
- W4288025187 hasConceptScore W4288025187C80444323 @default.
- W4288025187 hasConceptScore W4288025187C90119067 @default.
- W4288025187 hasLocation W42880251871 @default.
- W4288025187 hasLocation W42880251872 @default.
- W4288025187 hasOpenAccess W4288025187 @default.
- W4288025187 hasPrimaryLocation W42880251871 @default.
- W4288025187 hasRelatedWork W1569731655 @default.
- W4288025187 hasRelatedWork W1988011810 @default.
- W4288025187 hasRelatedWork W1988500978 @default.
- W4288025187 hasRelatedWork W2012799621 @default.
- W4288025187 hasRelatedWork W2095393099 @default.
- W4288025187 hasRelatedWork W2963698099 @default.
- W4288025187 hasRelatedWork W2987132678 @default.
- W4288025187 hasRelatedWork W3037046231 @default.
- W4288025187 hasRelatedWork W4288025187 @default.
- W4288025187 hasRelatedWork W2583506413 @default.
- W4288025187 isParatext "false" @default.
- W4288025187 isRetracted "false" @default.
- W4288025187 workType "article" @default.