Algorithmic aspects of the S-labeling problem

DOI10.1007/978-3-319-29516-9_15MaRDI QIDQ2798230zbMATH OpenOpenAlexFDO

Authors Guillaume Fertin, Irena Rusu, Stéphane Vialette

Publication date 4 April 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-29516-9_15

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• The \(S\)-\textsc{labeling} problem: an algorithmic tour
• On the \(S\)-\textsc{Labeling} problem
• Algorithmic expedients for the S-labeling problem
• An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees
• Maximum gap labelings of graphs

Cited in

(10)

• scientific article; zbMATH DE number 7364985 (Why is no real title available?)
• Algorithmic expedients for the S-labeling problem
• On the \(S\)-\textsc{Labeling} problem
• Population-based iterated greedy algorithm for the S-labeling problem
• The \(S\)-\textsc{labeling} problem: an algorithmic tour
• Algorithms for the multiple label placement problem
• scientific article; zbMATH DE number 1759551 (Why is no real title available?)
• The tree profile problem and optimal edge labeling.
• Maximum gap labelings of graphs
• Algorithms and complexity for a class of combinatorial optimization problems with labelling

This page was built for publication: Algorithmic aspects of the \(S\)-labeling problem

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