The S-\textsc{labeling} problem: an algorithmic tour

DOI10.1016/J.DAM.2017.07.036MaRDI QIDQ1647835zbMATH OpenOpenAlexFDO

Authors Guillaume Fertin, Irena Rusu, Stéphane Vialette

Publication date 27 June 2018

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

Full work available at URL https://doi.org/10.1016/j.dam.2017.07.036

zbMATH Keywords

algorithmgraph labeling

Mathematics Subject Classification ID

Vertex degrees (05C07) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Algorithmic aspects of the S-labeling problem
• On the \(S\)-\textsc{Labeling} problem
• Algorithmic expedients for the S-labeling problem
• Maximum gap labelings of graphs
• The $L(2,1)$-Labeling Problem on Graphs

Cites work

• A framework for solving VLSI graph layout problems
• A Separator Theorem for Planar Graphs
• Algorithmic aspects of the S-labeling problem
• Corrigendum to: ``The linear arrangement problem parameterized above guaranteed value
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 4070955 (Why is no real title available?)
• scientific article; zbMATH DE number 3632548 (Why is no real title available?)
• scientific article; zbMATH DE number 1263176 (Why is no real title available?)
• scientific article; zbMATH DE number 1303526 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 1953444 (Why is no real title available?)
• scientific article; zbMATH DE number 1507224 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• Introduction to algorithms.
• Mapping the genome
• On the \(S\)-\textsc{Labeling} problem
• On the Lambert \(w\) function
• Optimal Assignments of Numbers to Vertices
• Optimal Linear Ordering
• Packing of (0, 1)-matrices
• Parameterizing above Guaranteed Values: MaxSat and MaxCut
• Single Machine Job Sequencing with Precedence Constraints
• The linear arrangement problem parameterized above guaranteed value

Cited in

(8)

• Maximum gap labelings of graphs
• Algorithmic expedients for the S-labeling problem
• Algorithms and complexity for a class of combinatorial optimization problems with labelling
• Algorithmic aspects of the S-labeling problem
• On the \(S\)-\textsc{Labeling} problem
• Algorithmic complexity of proper labeling problems
• scientific article; zbMATH DE number 1759551 (Why is no real title available?)
• Population-based iterated greedy algorithm for the S-labeling problem

This page was built for publication: The \(S\)-\textsc{labeling} problem: an algorithmic tour

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