Buscar
Mostrando ítems 1-10 de 902
Engineering Design under Imprecise Probabilities: Computational Complexity
(Universidad de La Frontera. Departamento de Matemática y EstadísticaUniversidade Federal de Pernambuco. Departamento de Matemática, 2011)
Reconstructing 3-colored grids from horizontal and vertical projections is NP-Hard: a solution to the 2-Atom problem in discrete tomography
(SIAM PUBLICATIONS, 2012)
We consider the problem of coloring a grid using k colors with the restriction that each row and each column has a specific number of cells of each color. This problem has been known as the (k - 1)-atom problem in the ...
An exploration of simulated annealing and its implementations to solve NP-hard problems
(Universidad de los AndesIngeniería de Sistemas y ComputaciónFacultad de IngenieríaDepartamento de Ingeniería de Sistemas y Computación, 2021)
Simulación de algoritmos aproximados para solucionar rápido problemas NP
Multicolour Paths In Graphs: Np-hardness, Algorithms, And Applications On Routing In Wdm Networks
(SpringerDordrecht, 2017)
b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs
(Springer, 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 of a graph , denoted by , is the maximum number such that admits ...
The total chromatic number of some bipartite graphs
(Charles Babbage Res CtrWinnipegCanadá, 2008)
The open capacitated arc routing problem
(2009-01-01)