Analysis and design of algorithms for combinatorial problems [electronic resource] / edited by G. Ausiello and M. Lucertini.

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...

Full description

Bibliographic Details

Online Access:	Full Text (via ScienceDirect)
Corporate Author:	Istituto di analisi dei sistemi ed informatica (Italy)
Other Authors:	Ausiello, G. (Giorgio), 1941-, Lucertini, M. (Mario)
Format:	Electronic eBook
Language:	English
Published:	Amsterdam ; New York : New York, N.Y., U.S.A. : North-Holland ; Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., 1985.
Series:	Annals of discrete mathematics ; 25. North-Holland mathematics studies ; 109.
Subjects:	Combinatorial analysis > Data processing.