Buscar
Mostrando ítems 1-10 de 67
Formulations and valid inequalities for the node capacitated graph partitioning problem
(SpringerNew YorkEUA, 1996)
Avd-total-colouring Of Complete Equipartite Graphs
(ELSEVIER SCIENCE BVAMSTERDAM, 2015)
The node capacitated graph partitioning problem: A computational study
(SpringerNew YorkEUA, 1998)
Tutte's 3-flow conjecture and matchings in bipartite graphs
(Charles Babbage Res CtrWinnipegCanadá, 2005)