Determining the \(L(2,1)\)-span in polynomial space (Q2446848): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1566770704
@@ Property / OpenAlex ID: W1566770704 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q62595917
@@ Property / Wikidata QID: Q62595917 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.4506
@@ Property / arXiv ID: 1104.4506 / rank @@
+Normal rank
@@ Property / cites work @@
+-coloring in time
@@ Property / cites work: 3-coloring in time / rank @@
+Normal rank
@@ Property / cites work @@
+Set Partitioning via Inclusion-Exclusion
@@ Property / cites work: Set Partitioning via Inclusion-Exclusion / rank @@
+Normal rank
@@ Property / cites work @@
+Approximations for  -Colorings of Graphs
@@ Property / cites work: Approximations for -Colorings of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Channel assignment via fast zeta transform
@@ Property / cites work: Channel assignment via fast zeta transform / 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 @@
+Small Maximal Independent Sets and Faster Exact Graph Coloring
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter complexity of \(\lambda\)-labelings
+Normal rank
@@ Property / cites work @@
+On the \(L(p,1)\)-labelling of graphs
@@ Property / cites work: On the \(L(p,1)\)-labelling of graphs / rank @@
+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 @@
+Q3579493
@@ Property / cites work: Q3579493 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree
+Normal rank
@@ Property / cites work @@
+Determining the L(2,1)-Span in Polynomial Space
@@ Property / cites work: Determining the L(2,1)-Span in Polynomial Space / rank @@
+Normal rank
@@ Property / cites work @@
+On Improved Exact Algorithms for L(2,1)-Labeling of Graphs
+Normal rank
@@ Property / cites work @@
+On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the channel assignment problem
+Normal rank
@@ Property / cites work @@
+On cliques in graphs
@@ Property / cites work: On cliques in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5403002
@@ Property / cites work: Q5403002 / rank @@
+Normal rank