On the S-\textsc{Labeling} problem

DOI10.1016/J.ENDM.2009.07.044MaRDI QIDQ2851476zbMATH OpenOpenAlexFDO

Authors Guillaume Fertin, Stéphane Vialette

Publication date 10 October 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2009.07.044

Mathematics Subject Classification ID

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

Recommendations

• The \(S\)-\textsc{labeling} problem: an algorithmic tour
• Algorithmic aspects of the S-labeling problem
• Algorithmic expedients for the S-labeling problem
• Maximum gap labelings of graphs
• Algorithmic complexity of proper labeling problems

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• Packing of (0, 1)-matrices

Cited in

(8)

• The \(S\)-\textsc{labeling} problem: an algorithmic tour
• Algorithmic expedients for the S-labeling problem
• Algorithmic aspects of the S-labeling problem
• Results on the min-sum vertex cover problem
• scientific article; zbMATH DE number 4066896 (Why is no real title available?)
• scientific article; zbMATH DE number 1759551 (Why is no real title available?)
• Population-based iterated greedy algorithm for the S-labeling problem
• On the non-existence of an \(R\)-labeling

This page was built for publication: On the \(S\)-\textsc{Labeling} problem

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