On improved exact algorithms for L(2,1)-labeling of graphs

DOI10.1007/978-3-642-19222-7_4MaRDI QIDQ3000491zbMATH OpenOpenAlexFDO

Authors Konstanty Junosza-Szaniawski, Paweł Rzążewski

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)

Recommendations

• On the complexity of exact algorithm for L(2,1)-labeling of graphs
• Fast exact algorithm for \(L(2,1)\)-labeling of graphs
• Fast exact algorithm for L(2,1)-labeling of graphs
• Exact algorithms for \(L(2,1)\)-labeling of graphs
• Determining the \(L(2,1)\)-span in polynomial space

Cites work

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

Cited in

(19)

• Exact Algorithms for L(2,1)-Labeling of Graphs
• Fast exact algorithm for \(L(2,1)\)-labeling of graphs
• scientific article; zbMATH DE number 7404291 (Why is no real title available?)
• Exact algorithms for \(L(2,1)\)-labeling of graphs
• Injective \(L(2,1)\)-coloring as an optimization problem on the set of permutations of graph vertices: domishold graphs
• Algorithmic complexity of proper labeling problems
• A 116/13-approximation algorithm for \(L(2,1)\)-labeling of unit disk graphs
• Improved upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs
• On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs
• Determining the \(L(2,1)\)-span in polynomial space
• Distance three labelings of trees
• Determining the \(L(2,1)\)-span in polynomial space
• A Linear Time Algorithm for L(2,1)-Labeling of Trees
• Fast exact algorithm for \(L(2,1)\)-labeling of graphs
• On the number of 2-packings in a connected graph
• An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs
• Colorings with few colors: counting, enumeration and combinatorial bounds
• Channel assignment via fast zeta transform
• A linear time algorithm for \(L(2,1)\)-labeling of trees

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)