Fixing improper colorings of graphs (Q1698729): Difference between revisions

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+Fixing Improper Colorings of Graphs
@@ description / en / description / en @@
+scientific article; zbMATH DE number 6406444
@@ Property / title @@
+Fixing Improper Colorings of Graphs (English)
@@ Property / title: Fixing Improper Colorings of Graphs (English) / rank @@
+Normal rank
@@ Property / zbMATH Open document ID @@
+.68072
@@ Property / zbMATH Open document ID: 1386.68072 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-662-46078-8_22
@@ Property / DOI: 10.1007/978-3-662-46078-8_22 / rank @@
+Normal rank
@@ Property / published in @@
+Lecture Notes in Computer Science
@@ Property / published in: Lecture Notes in Computer Science / rank @@
+Normal rank
@@ Property / publication date @@
+February 2015Timestamp +2015-02-20T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2015-02-20T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 20 February 2015 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6406444
@@ Property / zbMATH DE Number: 6406444 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W340975445
@@ Property / OpenAlex ID: W340975445 / rank @@
+Normal rank
@@ Property / cites work @@
+Reoptimization of minimum and maximum traveling salesman's tours
+Normal rank
@@ Property / cites work @@
+Reoptimization of the shortest common superstring problem
+Normal rank
@@ Property / cites work @@
+Set Partitioning via Inclusion-Exclusion
@@ Property / cites work: Set Partitioning via Inclusion-Exclusion / rank @@
+Normal rank
@@ Property / cites work @@
+Q3113681
@@ Property / cites work: Q3113681 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
+Normal rank
@@ Property / cites work @@
+Mixing 3-Colourings in Bipartite Graphs
@@ Property / cites work: Mixing 3-Colourings in Bipartite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Connectedness of the graph of vertex-colourings
@@ Property / cites work: Connectedness of the graph of vertex-colourings / rank @@
+Normal rank
@@ Property / cites work @@
+Finding paths between 3-colorings
@@ Property / cites work: Finding paths between 3-colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+On the complexity of reconfiguration problems
@@ Property / cites work: On the complexity of reconfiguration problems / rank @@
+Normal rank
@@ Property / cites work @@
+A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
+Normal rank
@@ Property / cites work @@
+Fixing improper colorings of graphs
@@ Property / cites work: Fixing improper colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4838453
@@ Property / cites work: Q4838453 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5365080
@@ Property / cites work: Q5365080 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4904144
@@ Property / cites work: Q4904144 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002818
@@ Property / cites work: Q3002818 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams
+Normal rank
@@ Property / cites work @@
+A Theory and Algorithms for Combinatorial Reoptimization
+Normal rank
@@ Property / cites work @@
+New Reoptimization Techniques applied to Steiner Tree Problem
+Normal rank