Suchergebnisse - 1-absolute approximation algorithm
-
1
Equitable colorings of -corona products of cubic graphs
ISSN: 1230-2384Veröffentlicht: Polish Academy of Sciences 29.03.2024Veröffentlicht in Archives of control sciences (29.03.2024)“… 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 …”
Volltext
Journal Article -
2
Equitable colorings of l-corona products of cubic graphs
ISSN: 1230-2384, 2300-2611Veröffentlicht: Warsaw De Gruyter Brill Sp. z o.o., Paradigm Publishing Services 01.01.2024Veröffentlicht in Archives of control sciences (01.01.2024)“… 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 …”
Volltext
Journal Article -
3
Sorting genomes by prefix double-cut-and-joins
ISSN: 0304-3975, 1879-2294Veröffentlicht: Elsevier B.V 12.01.2025Veröffentlicht in Theoretical computer science (12.01.2025)“… ) 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 …”
Volltext
Journal Article -
4
The computational complexity of the backbone coloring problem for planar graphs with connected backbones
ISSN: 0166-218X, 1872-6771Veröffentlicht: Elsevier B.V 31.03.2015Veröffentlicht in Discrete Applied Mathematics (31.03.2015)“… (V(G))≤k? is either NP-complete or polynomially solvable (by algorithms that run in constant, linear or quadratic time …”
Volltext
Journal Article