Matches in SemOpenAlex for { <https://semopenalex.org/work/W2052293722> ?p ?o ?g. }
Showing items 1 to 50 of
50
with 100 items per page.
- W2052293722 abstract "A weighted directed graph GQ = (V, E) is defined for Q, the set of problems known to be NP-complete, with a vertex vi in V being an NP-complete problem pi in Q and the weight of an edge in E being the complexity of the transformation used to prove the NP-completeness of a problem. If the complexity of problem p1 relative to problem p2 is defined as the minimum complexity of a reduction from p1 to p2 (considering all paths from v1 to v2 in V) then the relative complexity graph of Q is the weighted graph GQR = (V, E'), with the weight of edge e'ij being the minimum complexity of p1 relative to p2. An O(n3) variant of the shortest path problem on directed graphs that is similar to the Floyd algorithm for all-pairs shortest paths is used to construct GQR. GQR can be updated with an O(n2) algorithm when a reduction with smaller complexity is found or a new edge is added to the graph, and with an O(n) algorithm if a new vertex (corresponding to the discovery of a new NP-complete problem) is added to the graph." @default.
- W2052293722 created "2016-06-24" @default.
- W2052293722 creator A5086096412 @default.
- W2052293722 date "1997-01-01" @default.
- W2052293722 modified "2023-09-25" @default.
- W2052293722 title "A graph for NP-complete problems" @default.
- W2052293722 cites W2003305391 @default.
- W2052293722 cites W2086471530 @default.
- W2052293722 doi "https://doi.org/10.1145/2817460.2817501" @default.
- W2052293722 hasPublicationYear "1997" @default.
- W2052293722 type Work @default.
- W2052293722 sameAs 2052293722 @default.
- W2052293722 citedByCount "0" @default.
- W2052293722 crossrefType "proceedings-article" @default.
- W2052293722 hasAuthorship W2052293722A5086096412 @default.
- W2052293722 hasConcept C11413529 @default.
- W2052293722 hasConcept C114614502 @default.
- W2052293722 hasConcept C118615104 @default.
- W2052293722 hasConcept C132525143 @default.
- W2052293722 hasConcept C179799912 @default.
- W2052293722 hasConcept C22590252 @default.
- W2052293722 hasConcept C311688 @default.
- W2052293722 hasConcept C33923547 @default.
- W2052293722 hasConcept C80899671 @default.
- W2052293722 hasConceptScore W2052293722C11413529 @default.
- W2052293722 hasConceptScore W2052293722C114614502 @default.
- W2052293722 hasConceptScore W2052293722C118615104 @default.
- W2052293722 hasConceptScore W2052293722C132525143 @default.
- W2052293722 hasConceptScore W2052293722C179799912 @default.
- W2052293722 hasConceptScore W2052293722C22590252 @default.
- W2052293722 hasConceptScore W2052293722C311688 @default.
- W2052293722 hasConceptScore W2052293722C33923547 @default.
- W2052293722 hasConceptScore W2052293722C80899671 @default.
- W2052293722 hasLocation W20522937221 @default.
- W2052293722 hasOpenAccess W2052293722 @default.
- W2052293722 hasPrimaryLocation W20522937221 @default.
- W2052293722 hasRelatedWork W1719252778 @default.
- W2052293722 hasRelatedWork W2008276241 @default.
- W2052293722 hasRelatedWork W2034217845 @default.
- W2052293722 hasRelatedWork W2043294549 @default.
- W2052293722 hasRelatedWork W2169820283 @default.
- W2052293722 hasRelatedWork W2374778222 @default.
- W2052293722 hasRelatedWork W2555545330 @default.
- W2052293722 hasRelatedWork W30750922 @default.
- W2052293722 hasRelatedWork W4306705875 @default.
- W2052293722 hasRelatedWork W922283457 @default.
- W2052293722 isParatext "false" @default.
- W2052293722 isRetracted "false" @default.
- W2052293722 magId "2052293722" @default.
- W2052293722 workType "article" @default.