List rankings and on-line list rankings of graphs

DOI10.1016/J.DAM.2015.12.014zbMATH Open1333.05267arXiv1401.3498OpenAlexW2229122671MaRDI QIDQ266945FDOQ266945

Authors: Daniel C. McDonald 

Publication date: 7 April 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Abstract: A $k$-ranking of a graph $G$ is a labeling of its vertices from $1,ldots,k$ such that any nontrivial path whose endpoints have the same label contains a larger label. The least $k$ for which $G$ has a $k$-ranking is the ranking number of $G$, also known as tree-depth. The list ranking number of $G$ is the least $k$ such that if each vertex of $G$ is assigned a set of $k$ potential labels, then $G$ can be ranked by labeling each vertex with a label from its assigned list. Rankings model a certain parallel processing problem in manufacturing, while the list ranking version adds scheduling constraints. We compute the list ranking number of paths, cycles, and trees with many more leaves than internal vertices. Some of these results follow from stronger theorems we prove about on-line versions of list ranking, where each vertex starts with an empty list having some fixed capacity, and potential labels are presented one by one, at which time they are added to the lists of certain vertices; the decision of which of these vertices are actually to be ranked with that label must be made immediately.

Full work available at URL: https://arxiv.org/abs/1401.3498

Recommendations

• On-line rankings of graphs
• Rankings of Graphs
• Rankings of graphs
• A note on on-line ranking number of graphs
• Ranking numbers of graphs
• On graphs associated to sets of rankings
• Rankings of Directed Graphs
• On-line ranking of split graphs
• On order and rank of graphs
• Online ranking for tournament graphs

zbMATH Keywords

list rankingon-line list rankingranking numbertree-depthvertex ranking

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Optimal node ranking of trees
• Mr. Paint and Mrs. Correct
• Grad and classes with bounded expansion. I: Decompositions
• Grad and classes with bounded expansion. II: Algorithmic aspects
• Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
• Tree-depth, subgraph coloring and homomorphism bounds
• Title not available (Why is that?)
• On-line vertex ranking of trees
• Rankings of Graphs
• Title not available (Why is that?)
• On-line ranking number for cycles and paths
• Characterisations and examples of graph classes with bounded expansion
• LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth
• On an edge ranking problem of trees and graphs
• Edge ranking and searching in partial orders
• Greedy rankings and arank numbers

Cited In (2)

• Graph 2-rankings
• On-line vertex ranking of trees

This page was built for publication: List rankings and on-line list rankings of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q266945)