Matches in SemOpenAlex for { <https://semopenalex.org/work/W2404002013> ?p ?o ?g. }
Showing items 1 to 67 of
67
with 100 items per page.
- W2404002013 endingPage "27" @default.
- W2404002013 startingPage "1" @default.
- W2404002013 abstract "In this paper, we propose an efficient algorithm to decompose a directed acyclic graph G into a minimized set of node-disjoint chains, which cover all the nodes of G. For any two nodes u and v on a chain, if u is above v then there is a path from u to v in G. The best algorithm for this problem up to now needs O(n) time, where n is the number of the nodes of G. Our algorithm, however, needs only O(n) time, where is G’s width, defined to be the size of a largest node subset U of G such that for every pair of nodes x, y U, there does not exist a path from x to y or from y to x. More importantly, by the existing algorithm, O(n) extra space (besides the space for G itself) is required to maintain the transitive closure of G to do the task while ours needs only O(n) extra space." @default.
- W2404002013 created "2016-06-24" @default.
- W2404002013 creator A5020069509 @default.
- W2404002013 creator A5087344765 @default.
- W2404002013 date "2015-01-10" @default.
- W2404002013 modified "2023-09-24" @default.
- W2404002013 title "On the DAG Decomposition" @default.
- W2404002013 cites W1541277988 @default.
- W2404002013 cites W1601764037 @default.
- W2404002013 cites W1965109038 @default.
- W2404002013 cites W1970064177 @default.
- W2404002013 cites W1979740015 @default.
- W2404002013 cites W1989806198 @default.
- W2404002013 cites W2000390918 @default.
- W2404002013 cites W2006001074 @default.
- W2404002013 cites W2012989825 @default.
- W2404002013 cites W2035616518 @default.
- W2404002013 cites W2044935944 @default.
- W2404002013 cites W2054633003 @default.
- W2404002013 cites W2075581822 @default.
- W2404002013 cites W2118382442 @default.
- W2404002013 cites W2141938776 @default.
- W2404002013 cites W2157529519 @default.
- W2404002013 cites W2340365916 @default.
- W2404002013 cites W3137220996 @default.
- W2404002013 doi "https://doi.org/10.9734/bjmcs/2015/19380" @default.
- W2404002013 hasPublicationYear "2015" @default.
- W2404002013 type Work @default.
- W2404002013 sameAs 2404002013 @default.
- W2404002013 citedByCount "4" @default.
- W2404002013 countsByYear W24040020132018 @default.
- W2404002013 countsByYear W24040020132019 @default.
- W2404002013 countsByYear W24040020132021 @default.
- W2404002013 crossrefType "journal-article" @default.
- W2404002013 hasAuthorship W2404002013A5020069509 @default.
- W2404002013 hasAuthorship W2404002013A5087344765 @default.
- W2404002013 hasConcept C124681953 @default.
- W2404002013 hasConcept C178790620 @default.
- W2404002013 hasConcept C185592680 @default.
- W2404002013 hasConcept C33923547 @default.
- W2404002013 hasConcept C41008148 @default.
- W2404002013 hasConceptScore W2404002013C124681953 @default.
- W2404002013 hasConceptScore W2404002013C178790620 @default.
- W2404002013 hasConceptScore W2404002013C185592680 @default.
- W2404002013 hasConceptScore W2404002013C33923547 @default.
- W2404002013 hasConceptScore W2404002013C41008148 @default.
- W2404002013 hasIssue "6" @default.
- W2404002013 hasLocation W24040020131 @default.
- W2404002013 hasOpenAccess W2404002013 @default.
- W2404002013 hasPrimaryLocation W24040020131 @default.
- W2404002013 hasRelatedWork W1974891317 @default.
- W2404002013 hasRelatedWork W2044189972 @default.
- W2404002013 hasRelatedWork W2313400459 @default.
- W2404002013 hasRelatedWork W2748952813 @default.
- W2404002013 hasRelatedWork W2899084033 @default.
- W2404002013 hasRelatedWork W2913765211 @default.
- W2404002013 hasRelatedWork W4225152035 @default.
- W2404002013 hasRelatedWork W4244417643 @default.
- W2404002013 hasRelatedWork W4245490552 @default.
- W2404002013 hasRelatedWork W4293483146 @default.
- W2404002013 hasVolume "10" @default.
- W2404002013 isParatext "false" @default.
- W2404002013 isRetracted "false" @default.
- W2404002013 magId "2404002013" @default.
- W2404002013 workType "article" @default.