Greedy algorithms for generalized \(k\)-rankings of paths

DOI10.1016/J.IPL.2010.07.011zbMath1379.05112OpenAlexW2081238706MaRDI QIDQ1675774

Darren A. Narayan, Andrew Zemke, Sandra James

Publication date: 3 November 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.07.011

zbMATH Keywords

graph algorithmgreedy algorithmvertex coloringrank numberordered coloringminimal ranking

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Greedy algorithms for generalized \(k\)-rankings of paths

Cites Work

• Unnamed Item
• Greedy algorithms for generalized \(k\)-rankings of paths
• Rankings of Graphs
• Minimal rankings

This page was built for publication: Greedy algorithms for generalized \(k\)-rankings of paths