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

DOI10.1016/j.dam.2017.07.036zbMath1390.05202OpenAlexW2775376226MaRDI QIDQ1647835

Stéphane Vialette, Guillaume Fertin, Irena Rusu

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

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

Related Items (2)

Population-based iterated greedy algorithm for the S-labeling problem ⋮ Algorithmic expedients for the \(S\)-labeling problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Corrigendum to: ``The linear arrangement problem parameterized above guaranteed value
• A framework for solving VLSI graph layout problems
• On the Lambert \(w\) function
• The linear arrangement problem parameterized above guaranteed value
• Algorithmic Aspects of the S-Labeling Problem
• On the S-Labeling problem
• Packing of (0, 1)-matrices
• A Separator Theorem for Planar Graphs
• Single Machine Job Sequencing with Precedence Constraints
• Parameterizing above Guaranteed Values: MaxSat and MaxCut
• Optimal Linear Ordering
• Mapping the genome
• Optimal Assignments of Numbers to Vertices

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