On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs (Q1944116): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2011.04.010
+Normal rank
@@ Property / OpenAlex ID @@
+W2080732177
@@ Property / OpenAlex ID: W2080732177 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q62595924
@@ Property / Wikidata QID: Q62595924 / rank @@
+Normal rank
@@ Property / cites work @@
+On computing a longest path in a tree
@@ Property / cites work: On computing a longest path in a tree / rank @@
+Normal rank
@@ Property / cites work @@
+\(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\)
+Normal rank
@@ Property / cites work @@
+Theoretical Computer Science
@@ Property / cites work: Theoretical Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter complexity of \(\lambda\)-labelings
+Normal rank
@@ Property / cites work @@
+Labelling Graphs with a Condition at Distance 2
@@ Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact algorithms for \(L(2,1)\)-labeling of graphs
+Normal rank
@@ Property / cites work @@
+On Improved Exact Algorithms for L(2,1)-Labeling of Graphs
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the channel assignment problem
+Normal rank