Search Results - "Polytime Dynamic Programming Algorithms"

  • Showing 1 - 3 results of 3
Refine Results
  1. 1
    Cover Image

    b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs by Bonomo, Flavia, Schaudt, Oliver, Stein, Maya, Valencia-Pabon, Mario

    ISSN: 0178-4617, 1432-0541
    Published: New York Springer US 01.10.2015
    Published in Algorithmica (01.10.2015)
    “…A b-coloring of a graph is a proper coloring such that every color class contains a vertex that is adjacent to all other color classes. The b-chromatic number…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  2. 2
    Cover Image

    The k-path coloring problem in graphs of bounded treewidth: An application in integrated circuit manufacturing by Ait-Ferhat, Dehia, Juliard, Vincent, Stauffer, Gautier, Torres, Juan Andres

    ISSN: 0167-6377, 1872-7468
    Published: Elsevier B.V 01.09.2020
    Published in Operations research letters (01.09.2020)
    “… We devise a direct (i.e. not relying on Courcelle’s celebrated theorem) polytime dynamic programming algorithm for graphs of bounded treewidth and we provide…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  3. 3
    Cover Image

    The \(k\)-path coloring problem in graphs with bounded treewidth: an application in integrated circuit manufacturing by Ait-Ferhat, Dehia, Juliard, Vincent, Stauffer, Gautier, Torres, Andres

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 26.04.2019
    Published in arXiv.org (26.04.2019)
    “…: (i) on the methodological side, we show that the \(k\)-path coloring problem can be solved in polynomial time on graphs with bounded treewidth and we devise a simple polytime dynamic programming algorithm in this case…”
    Get full text
    Paper
    Save to List
    Saved in:

Search Tools: