Results 271 to 280 of about 116,082 (316)
Robust consensus ordinal priority approach for improvisational emergency supplier selection under expert consensus ambiguity. [PDF]
Sci RepMao H, Wang R.
europepmc +1 more source
Communication Research Priorities for Autism Research: Insights from a Caregiver Survey. [PDF]
Behav Sci (Basel)Huntley T, Haebig E.
europepmc +1 more source
Entropy and Normalization in MCDA: A Data-Driven Perspective on Ranking Stability. [PDF]
Entropy (Basel)Roszkowska E.
europepmc +1 more source
Poset sensitivity analysis reveals post 2020 changes in human development index components. [PDF]
iScienceMartori F, Hirai T.
europepmc +1 more source
Sustainable development trade-offs shape the acceptability of climate mitigation scenarios
Parrado-Hernando G +13 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
To Rank or To Be Ranked: The Impact of Global Rankings in Higher Education
Journal of Studies in International Education, 2007Global university rankings have cemented the notion of a world university market arranged in a single “league table” for comparative purposes and have given a powerful impetus to intranational and international competitive pressures in the sector. Both the research rankings by Shanghai Jiao Tong University and the composite rankings by the Times Higher
Simon Marginson, Marijk Van Der Wende
exaly +7 more sources
SIAM Journal on Discrete Mathematics, 1995
Summary: A vertex (edge) coloring \(\phi:V\rightarrow \{1,2,\ldots,t\}\) (\(\phi':E\rightarrow \{1,2,\ldots, t\})\) of a graph \(G=(V,E)\) is a vertex (edge) \(t\)-ranking if, for any two vertices (edges) of the same color, every path between them contains a vertex (edge) of larger color. The vertex ranking number \(\chi_{r}(G)\) (edge ranking number \(
Hans L. Bodlaender +6 more
openaire +3 more sources
Summary: A vertex (edge) coloring \(\phi:V\rightarrow \{1,2,\ldots,t\}\) (\(\phi':E\rightarrow \{1,2,\ldots, t\})\) of a graph \(G=(V,E)\) is a vertex (edge) \(t\)-ranking if, for any two vertices (edges) of the same color, every path between them contains a vertex (edge) of larger color. The vertex ranking number \(\chi_{r}(G)\) (edge ranking number \(
Hans L. Bodlaender +6 more
openaire +3 more sources