Cargando…
Analysis and design of algorithms for combinatorial problems
Combinatorial problems have been from the very beginning part of the history of mathematics. By the Sixties, the main classes of combinatorial problems had been defined. During that decade, a great number of research contributions in graph theory had been produced, which laid the foundations for mos...
Autores principales: | Ausiello, G, Lucertini, M |
---|---|
Lenguaje: | eng |
Publicado: |
North-Holland
1985
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/1990683 |
Ejemplares similares
-
CISM School in Analysis and Design of Algorithms in Combinatorial Optimization
por: Ausiello, G, et al.
Publicado: (1981) -
Algorithms in combinatorial design theory
por: Colbourn, CJ, et al.
Publicado: (1985) -
Constructions and combinatorial problems in design of experiments
por: Raghavarao, Damaraju
Publicado: (1971) -
Combinatorial algorithms
por: Nijenhuis, Albert, et al.
Publicado: (1975) -
Algorithmic and combinatorial algebra
por: Bokut’, L A, et al.
Publicado: (1994)