Matches in SemOpenAlex for { <https://semopenalex.org/work/W4297799079> ?p ?o ?g. }
Showing items 1 to 65 of
65
with 100 items per page.
- W4297799079 abstract "In graph theory, the longest path problem is the problem of finding a simple path of maximum length in a given graph. For some small classes of graphs, the problem can be solved in polynomial time [2, 4], but it remains NP-hard on general graphs, since it includes the Hamiltonian path problem as a special case [3]. Motivated by finding a simple, quick algorithm for finding long paths in large graphs, in this paper we show a greedy algorithm with a time complexity of O(n^2 (n+m)), where n is the number of the vertices and m is the number of edges." @default.
- W4297799079 created "2022-10-01" @default.
- W4297799079 creator A5070735946 @default.
- W4297799079 date "2012-09-12" @default.
- W4297799079 modified "2023-09-26" @default.
- W4297799079 title "A greedy approximation algorithm for the longest path problem in undirected graphs" @default.
- W4297799079 doi "https://doi.org/10.48550/arxiv.1209.2503" @default.
- W4297799079 hasPublicationYear "2012" @default.
- W4297799079 type Work @default.
- W4297799079 citedByCount "0" @default.
- W4297799079 crossrefType "posted-content" @default.
- W4297799079 hasAuthorship W4297799079A5070735946 @default.
- W4297799079 hasBestOaLocation W42977990791 @default.
- W4297799079 hasConcept C104737047 @default.
- W4297799079 hasConcept C11413529 @default.
- W4297799079 hasConcept C114614502 @default.
- W4297799079 hasConcept C118615104 @default.
- W4297799079 hasConcept C132525143 @default.
- W4297799079 hasConcept C1465435 @default.
- W4297799079 hasConcept C160446614 @default.
- W4297799079 hasConcept C199360897 @default.
- W4297799079 hasConcept C203776342 @default.
- W4297799079 hasConcept C2777735758 @default.
- W4297799079 hasConcept C3018234147 @default.
- W4297799079 hasConcept C311688 @default.
- W4297799079 hasConcept C33923547 @default.
- W4297799079 hasConcept C41008148 @default.
- W4297799079 hasConcept C43517604 @default.
- W4297799079 hasConcept C51823790 @default.
- W4297799079 hasConcept C74133993 @default.
- W4297799079 hasConcept C86524685 @default.
- W4297799079 hasConceptScore W4297799079C104737047 @default.
- W4297799079 hasConceptScore W4297799079C11413529 @default.
- W4297799079 hasConceptScore W4297799079C114614502 @default.
- W4297799079 hasConceptScore W4297799079C118615104 @default.
- W4297799079 hasConceptScore W4297799079C132525143 @default.
- W4297799079 hasConceptScore W4297799079C1465435 @default.
- W4297799079 hasConceptScore W4297799079C160446614 @default.
- W4297799079 hasConceptScore W4297799079C199360897 @default.
- W4297799079 hasConceptScore W4297799079C203776342 @default.
- W4297799079 hasConceptScore W4297799079C2777735758 @default.
- W4297799079 hasConceptScore W4297799079C3018234147 @default.
- W4297799079 hasConceptScore W4297799079C311688 @default.
- W4297799079 hasConceptScore W4297799079C33923547 @default.
- W4297799079 hasConceptScore W4297799079C41008148 @default.
- W4297799079 hasConceptScore W4297799079C43517604 @default.
- W4297799079 hasConceptScore W4297799079C51823790 @default.
- W4297799079 hasConceptScore W4297799079C74133993 @default.
- W4297799079 hasConceptScore W4297799079C86524685 @default.
- W4297799079 hasLocation W42977990791 @default.
- W4297799079 hasOpenAccess W4297799079 @default.
- W4297799079 hasPrimaryLocation W42977990791 @default.
- W4297799079 hasRelatedWork W1506563608 @default.
- W4297799079 hasRelatedWork W1541438895 @default.
- W4297799079 hasRelatedWork W2089894925 @default.
- W4297799079 hasRelatedWork W2106934213 @default.
- W4297799079 hasRelatedWork W221676001 @default.
- W4297799079 hasRelatedWork W2256329187 @default.
- W4297799079 hasRelatedWork W2725940624 @default.
- W4297799079 hasRelatedWork W3118553797 @default.
- W4297799079 hasRelatedWork W4225144610 @default.
- W4297799079 hasRelatedWork W4297799079 @default.
- W4297799079 isParatext "false" @default.
- W4297799079 isRetracted "false" @default.
- W4297799079 workType "article" @default.