On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs
type: Item
instance of: scholarly article
title: On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs
zbMATH Open document ID: 1260.05162
author: Konstanty Junosza-Szaniawski
author: Paweł Rzążewski
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6150425
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: combinatorial problems
zbMATH Keywords: graph algorithms
zbMATH Keywords: \(L(2,1)\)-labeling
zbMATH Keywords: list labeling
zbMATH Keywords: graph coloring model
zbMATH Keywords: exact algorithm
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.04.010
OpenAlex ID: W2080732177
Wikidata QID: Q62595924
cites work: On computing a longest path in a tree
cites work: \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\)
cites work: Theoretical Computer Science
cites work: Fixed-parameter complexity of \(\lambda\)-labelings
cites work: Labelling Graphs with a Condition at Distance 2
cites work: Exact algorithms for \(L(2,1)\)-labeling of graphs
cites work: On Improved Exact Algorithms for L(2,1)-Labeling of Graphs
cites work: An exact algorithm for the channel assignment problem
DOI: 10.1016/J.IPL.2011.04.010
description: scientific article; zbMATH DE number 6150425