Matches in SemOpenAlex for { <https://semopenalex.org/work/W2004589984> ?p ?o ?g. }
Showing items 1 to 63 of
63
with 100 items per page.
- W2004589984 endingPage "66" @default.
- W2004589984 startingPage "59" @default.
- W2004589984 abstract "In the minimum linear arrangement problem one wishes to assign distinct integers to the vertices of a given graph so that the sum of the differences (in absolute value) across the edges of the graph is minimized. This problem is known to be NP-complete for the class of all graphs, but polynomial for trees algorithms of time complexity O(n2.2) and O(n1.6) were given by Shiloach [SIAM J. Comput. 8 (1979) 15-32] and Chung [Comput. Math. Appl. 10 (1984) 43-60], respectively. We present a linear-time algorithm for finding the optimal embedding (arrangement) in a restricted but important class of embeddings called one-page embeddings." @default.
- W2004589984 created "2016-06-24" @default.
- W2004589984 creator A5010990118 @default.
- W2004589984 creator A5068222606 @default.
- W2004589984 date "2003-07-01" @default.
- W2004589984 modified "2023-09-26" @default.
- W2004589984 title "Optimal one-page tree embeddings in linear time" @default.
- W2004589984 cites W1973942323 @default.
- W2004589984 cites W1998294201 @default.
- W2004589984 cites W2012951995 @default.
- W2004589984 cites W2030087828 @default.
- W2004589984 cites W2035359116 @default.
- W2004589984 cites W2090666691 @default.
- W2004589984 cites W2155126963 @default.
- W2004589984 doi "https://doi.org/10.1016/s0020-0190(03)00261-8" @default.
- W2004589984 hasPublicationYear "2003" @default.
- W2004589984 type Work @default.
- W2004589984 sameAs 2004589984 @default.
- W2004589984 citedByCount "17" @default.
- W2004589984 countsByYear W20045899842013 @default.
- W2004589984 countsByYear W20045899842014 @default.
- W2004589984 countsByYear W20045899842016 @default.
- W2004589984 countsByYear W20045899842020 @default.
- W2004589984 countsByYear W20045899842021 @default.
- W2004589984 countsByYear W20045899842022 @default.
- W2004589984 crossrefType "journal-article" @default.
- W2004589984 hasAuthorship W2004589984A5010990118 @default.
- W2004589984 hasAuthorship W2004589984A5068222606 @default.
- W2004589984 hasConcept C113174947 @default.
- W2004589984 hasConcept C11413529 @default.
- W2004589984 hasConcept C114614502 @default.
- W2004589984 hasConcept C311688 @default.
- W2004589984 hasConcept C33923547 @default.
- W2004589984 hasConcept C41008148 @default.
- W2004589984 hasConcept C80444323 @default.
- W2004589984 hasConceptScore W2004589984C113174947 @default.
- W2004589984 hasConceptScore W2004589984C11413529 @default.
- W2004589984 hasConceptScore W2004589984C114614502 @default.
- W2004589984 hasConceptScore W2004589984C311688 @default.
- W2004589984 hasConceptScore W2004589984C33923547 @default.
- W2004589984 hasConceptScore W2004589984C41008148 @default.
- W2004589984 hasConceptScore W2004589984C80444323 @default.
- W2004589984 hasIssue "2" @default.
- W2004589984 hasLocation W20045899841 @default.
- W2004589984 hasOpenAccess W2004589984 @default.
- W2004589984 hasPrimaryLocation W20045899841 @default.
- W2004589984 hasRelatedWork W1977238738 @default.
- W2004589984 hasRelatedWork W1978042415 @default.
- W2004589984 hasRelatedWork W2254769596 @default.
- W2004589984 hasRelatedWork W2355247546 @default.
- W2004589984 hasRelatedWork W2365333639 @default.
- W2004589984 hasRelatedWork W2365371251 @default.
- W2004589984 hasRelatedWork W2379488605 @default.
- W2004589984 hasRelatedWork W2386767533 @default.
- W2004589984 hasRelatedWork W32661046 @default.
- W2004589984 hasRelatedWork W4300903699 @default.
- W2004589984 hasVolume "87" @default.
- W2004589984 isParatext "false" @default.
- W2004589984 isRetracted "false" @default.
- W2004589984 magId "2004589984" @default.
- W2004589984 workType "article" @default.