Suchergebnisse - Polytime Dynamic Programming Algorithms

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

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

Weitere Verfasser: Bonomo, Flavia Schaudt, Oliver Stein, Maya et al.

Quelle: 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

Schlagwörter: [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

Dateibeschreibung: application/pdf

Zugangs-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

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

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

Schlagwörter: b-Coloring, Stability number two, Co-triangle-free graphs, NP-hardness, Treecographs, Polytime dynamic programming algorithms

Dateibeschreibung: application/pdf

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

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

A Stronger Model of Dynamic Programming Algorithms.

Autoren: Buresh-Oppenheim, Joshua Davis, Sashka Impagliazzo, Russell

Quelle: Algorithmica; Aug2011, Vol. 60 Issue 4, p938-968, 31p, 1 Chart, 1 Graph

Schlagwörter: ALGORITHMS, DYNAMIC programming, MATHEMATICAL optimization, MATHEMATICAL programming, LINEAR programming

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

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

Schlagwörter: 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

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

Toward a Model for Backtracking and Dynamic Programming.

Autoren: Alekhnovich, Michael Borodin, Allan Buresh-Oppenheim, Joshua et al.

Quelle: Computational Complexity; Dec2011, Vol. 20 Issue 4, p679-740, 62p

Schlagwörter: DYNAMIC programming, ALGORITHMS, SPECTRUM analysis, SATISFIABILITY (Computer science), KNAPSACK problems

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

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

Schlagwörter: 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

Verfügbarkeit: https://hdl.handle.net/20.500.12110/paper_01784617_v73_n2_p289_Bonomo

The [formula omitted]-path coloring problem in graphs of bounded treewidth: An application in integrated circuit manufacturing.

Autoren: Ait-Ferhat, Dehia Juliard, Vincent Stauffer, Gautier et al.

Quelle: Operations Research Letters. Sep2020, Vol. 48 Issue 5, p652-657. 6p. 2 Charts.

Schlagwörter: *INTEGRATED circuits manufacturing, *DYNAMIC programming, *ALGORITHMS, GRAPH coloring, FOOD color, GRAPH algorithms

Minimum concave cost flow over a grid network.

Autoren: He, Qie Ahmed, Shabbir Nemhauser, George

Quelle: Mathematical Programming; Apr2015, Vol. 150 Issue 1, p79-98, 20p

Schlagwörter: POLYNOMIAL time algorithms, POLYHEDRA, DYNAMIC programming, COST functions, NP-hard problems

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

Schlagwörter: 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

Verfügbarkeit: 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

Toward a model for backtracking and dynamic programming.

Autoren: Alekhnovich, M. Borodin, A. Buresh-Oppenheim, J. et al.

Quelle: 20th Annual IEEE Conference on Computational Complexity (CCC'05); 2005, p308-322, 15p

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

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

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

Schlagwörter: GRAPH coloring, BIPARTITE graphs, GRAPH theory, STABILITY theory, NP-complete problems

Constraint programming and operations research.

Autoren: Hooker, J. N. van Hoeve, W.-J.

Quelle: Constraints: An International Journal; Apr2018, Vol. 23 Issue 2, p172-195, 24p

Combinatorial Algorithms : 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings

Autoren: Veli Mäkinen Simon J. Puglisi Leena Salmela

Resource Type: eBook.

Schlagworte: Computer science—Mathematics, Discrete mathematics, Algorithms, Machine theory, Artificial intelligence—Data processing, Artificial intelligence

Categories: COMPUTERS / Computer Science, COMPUTERS / Artificial Intelligence / General, COMPUTERS / Database Administration & Management, COMPUTERS / Programming / Algorithms, MATHEMATICS / Discrete Mathematics

How to choose friends strategically.

Autoren: Narayanan, Lata Wu, Kangkang

Quelle: Theoretical Computer Science. Apr2020, Vol. 811, p99-111. 13p.

Schlagwörter: *NP-complete problems, *BIPARTITE graphs, *PATHS & cycles in graph theory, *ADOPTION of ideas, *VIRAL marketing, *SOCIAL networks, *POLYNOMIAL time algorithms

A Study on the Choquet-Based Criteria in Possibilistic Sequential Decision Making.

Autoren: Qiangqiang Li Mingrui Chen

Quelle: International Journal of Simulation: Systems, Science & Technology; 2016, Vol. 17 Issue 12, p1.1-1.5, 5p

Schlagwörter: DECISION making, CHOQUET theory

Sequential decision making under ordinal uncertainty: A qualitative alternative to the Hurwicz criterion.

Autoren: Fargier, Hélène Guillaume, Romain

Quelle: International Journal of Approximate Reasoning. Jan2020, Vol. 116, p1-18. 18p.

Schlagwörter: *DECISION making, *STATISTICAL decision making, *UNCERTAINTY, *DYNAMIC programming, *DECISION trees, *FUZZY sets, *PESSIMISM

The $k$-path coloring problem in graphs with bounded treewidth: an application in integrated circuit manufacturing

Autoren: Ait-Ferhat, Dehia Juliard, Vincent Stauffer, Gautier et al.

Index Begriffe: Computer Science - Discrete Mathematics, text

URL: http://arxiv.org/abs/1904.11805

b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs

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

Index Begriffe: Computer Science - Computational Complexity, Computer Science - Discrete Mathematics, Mathematics - Combinatorics, text

URL: http://arxiv.org/abs/1310.8313

Introduction To The Analysis Of Algorithms, An (3rd Edition)

Autoren: Michael Soltys-kulinicz

Resource Type: eBook.

Schlagworte: Algorithms--Textbooks

Categories: COMPUTERS / Programming / Algorithms, COMPUTERS / Programming / General

Algorithms, Part II

Autoren: Robert Sedgewick Kevin Wayne

Resource Type: eBook.

Categories: COMPUTERS / Software Development & Engineering / Systems Analysis & Design, COMPUTERS / Programming / Algorithms