Algorithmic Aspects of the S-Labeling Problem

DOI10.1007/978-3-319-29516-9_15zbMath1476.68206OpenAlexW2340845936MaRDI QIDQ2798230

Irena Rusu, Stéphane Vialette, Guillaume Fertin

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

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

Related Items (3)

The \(S\)-\textsc{labeling} problem: an algorithmic tour ⋮ Population-based iterated greedy algorithm for the S-labeling problem ⋮ Algorithmic expedients for the \(S\)-labeling problem

This page was built for publication: Algorithmic Aspects of the S-Labeling Problem