Matches in SemOpenAlex for { <https://semopenalex.org/work/W2081238706> ?p ?o ?g. }
Showing items 1 to 55 of
55
with 100 items per page.
- W2081238706 endingPage "985" @default.
- W2081238706 startingPage "979" @default.
- W2081238706 abstract "A k-ranking of a graph is a labeling of the vertices with positive integers 1,2,...,k so that every path connecting two vertices with the same label contains a vertex of larger label. An optimal ranking is one in which k is minimized. Let Pn be a path with n vertices. A greedy algorithm can be used to successively label each vertex with the smallest possible label that preserves the ranking property. We seek to show that when a greedy algorithm is used to label the vertices successively from left to right, we obtain an optimal ranking. A greedy algorithm of this type was given by Bodlaender et al. in 1998 [1] which generates an optimal k-ranking of Pn. In this paper we investigate two generalizations of rankings. We first consider bounded (k,s)-rankings in which the number of times a label can be used is bounded by a predetermined integer s. We then consider kt-rankings where any path connecting two vertices with the same label contains t vertices with larger labels. We show for both generalizations that when G is a path, the analogous greedy algorithms generate optimal k-rankings. We then proceed to quantify the minimum number of labels that can be used in these rankings. We define the bounded rank number (G)r,s to be the smallest number of labels that can be used in a (k,s)-ranking and show for n>=2, (Pn)r,[email protected]?((n-(2^i-1))/s)@?+i where [email protected]?log2(s)@?+1. We define the kt-rank number, (G)rt to be the smallest number of labels that can be used in a kt-ranking. We present a recursive formula that gives the kt-rank numbers for paths, showing (Pj)rt=n for all an-1" @default.
- W2081238706 created "2016-06-24" @default.
- W2081238706 creator A5013029293 @default.
- W2081238706 creator A5030556924 @default.
- W2081238706 creator A5090606695 @default.
- W2081238706 date "2010-10-01" @default.
- W2081238706 modified "2023-09-26" @default.
- W2081238706 title "Greedy algorithms for generalized k-rankings of paths" @default.
- W2081238706 cites W1535209533 @default.
- W2081238706 cites W2007280161 @default.
- W2081238706 cites W2039985220 @default.
- W2081238706 cites W2149977307 @default.
- W2081238706 cites W2172335165 @default.
- W2081238706 doi "https://doi.org/10.1016/j.ipl.2010.07.011" @default.
- W2081238706 hasPublicationYear "2010" @default.
- W2081238706 type Work @default.
- W2081238706 sameAs 2081238706 @default.
- W2081238706 citedByCount "0" @default.
- W2081238706 crossrefType "journal-article" @default.
- W2081238706 hasAuthorship W2081238706A5013029293 @default.
- W2081238706 hasAuthorship W2081238706A5030556924 @default.
- W2081238706 hasAuthorship W2081238706A5090606695 @default.
- W2081238706 hasConcept C11413529 @default.
- W2081238706 hasConcept C114614502 @default.
- W2081238706 hasConcept C33923547 @default.
- W2081238706 hasConcept C41008148 @default.
- W2081238706 hasConcept C51823790 @default.
- W2081238706 hasConcept C80444323 @default.
- W2081238706 hasConceptScore W2081238706C11413529 @default.
- W2081238706 hasConceptScore W2081238706C114614502 @default.
- W2081238706 hasConceptScore W2081238706C33923547 @default.
- W2081238706 hasConceptScore W2081238706C41008148 @default.
- W2081238706 hasConceptScore W2081238706C51823790 @default.
- W2081238706 hasConceptScore W2081238706C80444323 @default.
- W2081238706 hasIssue "22" @default.
- W2081238706 hasLocation W20812387061 @default.
- W2081238706 hasOpenAccess W2081238706 @default.
- W2081238706 hasPrimaryLocation W20812387061 @default.
- W2081238706 hasRelatedWork W1978042415 @default.
- W2081238706 hasRelatedWork W2017331178 @default.
- W2081238706 hasRelatedWork W2333698505 @default.
- W2081238706 hasRelatedWork W2351491280 @default.
- W2081238706 hasRelatedWork W2371447506 @default.
- W2081238706 hasRelatedWork W2386767533 @default.
- W2081238706 hasRelatedWork W2953093056 @default.
- W2081238706 hasRelatedWork W2976797620 @default.
- W2081238706 hasRelatedWork W303980170 @default.
- W2081238706 hasRelatedWork W3086542228 @default.
- W2081238706 hasVolume "110" @default.
- W2081238706 isParatext "false" @default.
- W2081238706 isRetracted "false" @default.
- W2081238706 magId "2081238706" @default.
- W2081238706 workType "article" @default.