On Improved Exact Algorithms for L(2,1)-Labeling of Graphs

DOI10.1007/978-3-642-19222-7_4zbMATH Open1295.05205OpenAlexW2204989461MaRDI QIDQ3000491FDOQ3000491

Paweł Rzążewski, Konstanty Junosza-Szaniawski

Publication date: 19 May 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-19222-7_4

Mathematics Subject Classification ID

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

Cites Work

• Fixed-parameter complexity of \(\lambda\)-labelings
• Exact algorithms for \(L(2,1)\)-labeling of graphs

Cited In (10)

• Title not available (Why is that?)
• Distance three labelings of trees
• Improved upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs
• Determining the \(L(2,1)\)-span in polynomial space
• Colorings with few colors: counting, enumeration and combinatorial bounds
• On the number of 2-packings in a connected graph
• Fast exact algorithm for \(L(2,1)\)-labeling of graphs
• On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs
• Fast Exact Algorithm for L(2,1)-Labeling of Graphs
• Channel assignment via fast zeta transform

This page was built for publication: On Improved Exact Algorithms for L(2,1)-Labeling of Graphs

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