Search Results - (( Polytime dynamic programming algorithms ) OR ( Polytime dynamik programming algorithms ))~

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

“…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

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

“… 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

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

“…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

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

“…: (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

Possibilistic sequential decision making by Ben Amor, Nahla, Fargier, Hélène, Guezguez, Wided

“…When the information about uncertainty cannot be quantified in a simple, probabilistic way, the topic of possibilistic decision theory is often a natural one…”
Get full text

Factor-guided motion planning for a robot arm by Jaesik Choi, Amir, E.

“… Our algorithm is unique in two ways: (a) it utilizes the topology of the arm and obstacles to factor the search space and reduce the complexity of the planning problem using dynamic programming; and (b…”
Get full text

Predicting and Detecting Symmetries in FOL Finite Model Search by Audemard, Gilles, Benhamou, Belaïd, Henocque, Laurent

“… On the other hand, dynamic symmetry detection is costly in the general case (the problem is Graph Iso complete…”
Get full text

Practically handling some configuration isomorphisms by Henocque, L., Prcovic, N.

“… Since no poly time algorithm is known for the general graph isomorphism problem, it is interesting to explore subproblems that can efficiently be exploited by backtrack search procedures…”
Get full text