Matches in SemOpenAlex for { <https://semopenalex.org/work/W2119337515> ?p ?o ?g. }
Showing items 1 to 63 of
63
with 100 items per page.
- W2119337515 endingPage "544" @default.
- W2119337515 startingPage "531" @default.
- W2119337515 abstract "We consider the following problem: Given an integer k and a network G with two distinct vertices s and t, find a maximum number of vertex disjoint paths from s to t of length bounded by k. In a recent work [9] it was shown that for length greater than four this problem is NP-hard. In this paper we present a polynomial heuristic algorithm for the problem for general length. The algorithm is proved to give optimal solution for length less than five. Experiments show very good results for the algorithm." @default.
- W2119337515 created "2016-06-24" @default.
- W2119337515 creator A5016280643 @default.
- W2119337515 creator A5077648725 @default.
- W2119337515 date "1984-01-01" @default.
- W2119337515 modified "2023-09-28" @default.
- W2119337515 title "Heuristics for finding a maximum number of disjoint bounded paths" @default.
- W2119337515 cites W2000733920 @default.
- W2119337515 cites W2008292658 @default.
- W2119337515 cites W2154434560 @default.
- W2119337515 cites W2168736424 @default.
- W2119337515 doi "https://doi.org/10.1002/net.3230140405" @default.
- W2119337515 hasPublicationYear "1984" @default.
- W2119337515 type Work @default.
- W2119337515 sameAs 2119337515 @default.
- W2119337515 citedByCount "27" @default.
- W2119337515 countsByYear W21193375152013 @default.
- W2119337515 countsByYear W21193375152014 @default.
- W2119337515 countsByYear W21193375152015 @default.
- W2119337515 countsByYear W21193375152017 @default.
- W2119337515 countsByYear W21193375152018 @default.
- W2119337515 crossrefType "journal-article" @default.
- W2119337515 hasAuthorship W2119337515A5016280643 @default.
- W2119337515 hasAuthorship W2119337515A5077648725 @default.
- W2119337515 hasConcept C114614502 @default.
- W2119337515 hasConcept C126255220 @default.
- W2119337515 hasConcept C127705205 @default.
- W2119337515 hasConcept C134306372 @default.
- W2119337515 hasConcept C33923547 @default.
- W2119337515 hasConcept C34388435 @default.
- W2119337515 hasConcept C41008148 @default.
- W2119337515 hasConcept C45340560 @default.
- W2119337515 hasConcept C80444323 @default.
- W2119337515 hasConceptScore W2119337515C114614502 @default.
- W2119337515 hasConceptScore W2119337515C126255220 @default.
- W2119337515 hasConceptScore W2119337515C127705205 @default.
- W2119337515 hasConceptScore W2119337515C134306372 @default.
- W2119337515 hasConceptScore W2119337515C33923547 @default.
- W2119337515 hasConceptScore W2119337515C34388435 @default.
- W2119337515 hasConceptScore W2119337515C41008148 @default.
- W2119337515 hasConceptScore W2119337515C45340560 @default.
- W2119337515 hasConceptScore W2119337515C80444323 @default.
- W2119337515 hasIssue "4" @default.
- W2119337515 hasLocation W21193375151 @default.
- W2119337515 hasOpenAccess W2119337515 @default.
- W2119337515 hasPrimaryLocation W21193375151 @default.
- W2119337515 hasRelatedWork W1978042415 @default.
- W2119337515 hasRelatedWork W2017331178 @default.
- W2119337515 hasRelatedWork W2075509416 @default.
- W2119337515 hasRelatedWork W2119337515 @default.
- W2119337515 hasRelatedWork W2148351559 @default.
- W2119337515 hasRelatedWork W3080875783 @default.
- W2119337515 hasRelatedWork W3086542228 @default.
- W2119337515 hasRelatedWork W3117837425 @default.
- W2119337515 hasRelatedWork W4221142572 @default.
- W2119337515 hasRelatedWork W4221158814 @default.
- W2119337515 hasVolume "14" @default.
- W2119337515 isParatext "false" @default.
- W2119337515 isRetracted "false" @default.
- W2119337515 magId "2119337515" @default.
- W2119337515 workType "article" @default.