Maximum gap labelings of graphs
From MaRDI portal
Publication:1944065
DOI10.1016/j.ipl.2010.11.010zbMath1259.05146MaRDI QIDQ1944065
Publication date: 4 April 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.11.010
approximation algorithms; graceful labelling of trees; maximum gap in graph; minimum edge deletion bipartition
68W40: Analysis of algorithms
68R10: Graph theory (including graph drawing) in computer science
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Cites Work