Výsledky vyhledávání - (("Polytime dynamic programming algorithms") OR ("Polytime dynamika programming algorithms"))*

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

“…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…”
Získat plný text

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

“… 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…”
Získat plný text

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

“…: (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…”
Získat plný text