Výsledky vyhledávání - 1-absolute approximation algorithm

Equitable colorings of -corona products of cubic graphs Autor Furmańczyk, Hanna, Kubale, Marek

“…A graph G is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ…”
Získat plný text

Equitable colorings of l-corona products of cubic graphs Autor Furmańczyk, Hanna, Kubale, Marek

“…A graph G is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ…”
Získat plný text

Sorting genomes by prefix double-cut-and-joins Autor Fertin, Guillaume, Jean, Géraldine, Labarre, Anthony

“…) two polynomial-time algorithms for sorting by prefix DCJs, both in the signed case (which answers an open question of Labarre [1]) and in the unsigned case; (3) a 1-absolute approximation algorithm for sorting by unsigned prefix reversals for a specific class of permutations…”
Získat plný text

The computational complexity of the backbone coloring problem for planar graphs with connected backbones Autor Janczewski, Robert, Turowski, Krzysztof

“…(V(G))≤k? is either NP-complete or polynomially solvable (by algorithms that run in constant, linear or quadratic time…”
Získat plný text