An algorithmic theory of numbers, graphs and convexity / Laszlo Lovasz
Type de document : MonographieCollection : CBMS-NSF regional conference series in applied mathematics, 50Langue : anglais.Pays: Etats Unis.Éditeur : Philadelphia, PA : Society for Industrial and Applied Mathematics, 1986Description : 1 vol. (III-91 p.) ; 26 cmISBN: 0898712033.ISSN: 0163-9439.Bibliographie : Bibliogr. p. 87-91.Sujet MSC : 05C35, Combinatorics - Graph theory, Extremal problems in graph theory11Yxx, Number theory - Computational number theory
52-04, Software, source code, etc. for problems pertaining to convex and discrete geometry
68R10, Discrete mathematics in relation to computer science, Graph theory
52A20, General convexity, Convex sets in n dimensions (including convex hypersurfaces)
90C10, Mathematical programming, Integer programmingEn-ligne : MSN | zbMath
| Item type | Current library | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
Monographie
|
CMI Salle 1 | 05 LOV (Browse shelf(Opens below)) | Available | 09387-01 |
Bibliogr. p. 87-91
There are no comments on this title.