Search Results - "Polytime Dynamic Programming Algorithms"

b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs

Authors: Bonomo, Flavia Schaudt, Oliver Stein, Maya et al.

Contributors: Bonomo, Flavia Schaudt, Oliver Stein, Maya et al.

Source: Lecture Notes in Computer Science ISBN: 9783319091730
Conicyt_qa
ANID
instacron:ANID
Algorithmica
Artículos CONICYT
CONICYT Chile
instacron:CONICYT
CONICET Digital (CONICET)
Consejo Nacional de Investigaciones Científicas y Técnicas
Articulos_ANID
Agencia Nacional de Investigación y Desarrollo

Subject Terms: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 0211 other engineering and technologies, [MATH] Mathematics [math], 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO] Computer Science [cs], Computational Complexity (cs.CC), Co-triangle-free graphs, 01 natural sciences, 7. Clean energy, Stability number two, Treecographs, Minimum Maxinal Matching, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], NP-hardness, FOS: Mathematics, Mathematics - Combinatorics, [INFO]Computer Science [cs], Polytime dynamic programming algorithms, [MATH]Mathematics [math], B-Coloring, Co-Bipartite Graphs, b-Coloring, 16. Peace & justice, Computer Science - Computational Complexity, Graphs with Stability Number Two, 13. Climate action, Combinatorics (math.CO), Computer Science - Discrete Mathematics

File Description: application/pdf

Access URL: https://ri.conicet.gov.ar/bitstream/11336/18897/1/CONICET_Digital_Nro.22766.pdf
http://arxiv.org/abs/1310.8313
https://hal.science/hal-01102516v1
https://hal.science/hal-01102516v1/document
https://doi.org/10.1007/s00453-014-9921-5
https://dblp.uni-trier.de/db/journals/corr/corr1310.html#BonomoSSV13
https://hal.inria.fr/hal-00926924
https://lipn.univ-paris13.fr/~valenciapabon/papers/b-col-cobip.pdf
https://link.springer.com/content/pdf/10.1007%2Fs00453-014-9921-5.pdf
https://arxiv.org/pdf/1310.8313
https://hal.archives-ouvertes.fr/hal-01102516/document
https://128.84.21.199/abs/1310.8313?context=math.CO
https://arxiv.org/abs/1310.8313
https://arxiv.org/pdf/1310.8313
https://repositorio-qa.anid.cl/handle/10533/147921
http://hdl.handle.net/10533/147921
http://hdl.handle.net/11336/18897
https://hdl.handle.net/10533/147921

Genome-wide Association Analysis Reveals Loci Associated With Resistance Against Piscirickettsia Salmonis In Two Atlantic Salmon (salmo Salar L.) ChRomosomes ; Bmc Genomics

Authors: Correa, K. Lhorente, JP Lopez, ME et al.

Subject Terms: Ciencias Biológicas, Computer Science, Software Engineering, Mathematics, Applied, resistance, salmon, were, salmonis, atlantic, genetic, genome, Ciencias Naturales, B-coloring, Stability Number Two, Co-triangle-free Graphs, Np-hardness, Treecographs, Polytime Dynamic Programming Algorithms

Relation: instname: ANID; reponame: Repositorio Digital RI2.0; https://doi.org/10.1186/s12864-015-2038-7; PFB03; WOS:000360668100003; https://hdl.handle.net/10533/87816

Availability: https://hdl.handle.net/10533/87816
https://doi.org/10.1186/s12864-015-2038-7

b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs

Authors: Bonomo, Flavia Schaudt, Oliver Stein, Maya et al.

Subject Terms: b-Coloring, Stability number two, Co-triangle-free graphs, NP-hardness, Treecographs, Polytime dynamic programming algorithms

File Description: application/pdf

Relation: Algorithmica Volumen: 73 Número: 2 oct 2015; https://repositorio.uchile.cl/handle/2250/135495

Availability: https://doi.org/10.1007/s00453-014-9921-5
https://repositorio.uchile.cl/handle/2250/135495

b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs

Authors: Bonomo, F. Schaudt, O. Stein, M. et al.

Subject Terms: b-Coloring, Co-triangle-free graphs, NP-hardness, Polytime dynamic programming algorithms, Stability number two, Treecographs, Color, Coloring, Dynamic programming, Forestry, Graphic methods, Polynomial approximation, Stability, Trees (mathematics), Dynamic programming algorithm, Stability number, Triangle-free graphs, Graph theory

Relation: https://hdl.handle.net/20.500.12110/paper_01784617_v73_n2_p289_Bonomo

Availability: https://hdl.handle.net/20.500.12110/paper_01784617_v73_n2_p289_Bonomo

b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs

Subject Terms: b-Coloring, Co-triangle-free graphs, NP-hardness, Polytime dynamic programming algorithms, Stability number two, Treecographs, Color, Coloring, Dynamic programming, Forestry, Graphic methods, Polynomial approximation, Stability, Trees (mathematics), Dynamic programming algorithm, Stability number, Triangle-free graphs, Graph theory

Relation: https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_01784617_v73_n2_p289_Bonomo; https://hdl.handle.net/20.500.12110/paper_01784617_v73_n2_p289_Bonomo

Availability: https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_01784617_v73_n2_p289_Bonomo
https://hdl.handle.net/20.500.12110/paper_01784617_v73_n2_p289_Bonomo

$$b$$ -Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs.

Authors: Bonomo, Flavia Schaudt, Oliver Stein, Maya et al.

Source: Algorithmica; Oct2015, Vol. 73 Issue 2, p289-305, 17p

Subject Terms: GRAPH coloring, BIPARTITE graphs, GRAPH theory, STABILITY theory, NP-complete problems