Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19783807

Combinatorics of ordered sets

Author
AIGNER, M; WILLE, R
Source

Discrete mathematics. 1991, Vol 88, Num 2-3, 215 p. ; ref : dissem

CODEN
DSMHA4
ISSN
0012-365X
Scientific domain
Computer science; Mathematics
Publisher
Elsevier, Amsterdam
Publication country
Netherlands
Document type
Serial Issue
Language
English
Keyword (fr)
Combinatoire Congrès Diagramme Dénombrement Ensemble ordonné Mesure complexité Mémoire dynamique Orientation Problème recherche Relation ordre partiel Théorie graphe Antichaîne Graphe comparabilité Graphe recouvrement Treillis distributif
Keyword (en)
Combinatorics Congress Diagram Enumeration(counting) Ordered set Complexity measurement Dynamical storage Orientation Search problem Partial ordering Graph theory Distributive lattice Comparability graph
Keyword (es)
Combinatoria Congreso Diagrama Recuento Conjunto ordenado Medida complexidad Memoria dinámica Orientación Problema investigación Relación orden parcial Teoría grafo
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02B Combinatorics. Ordered structures / 001A02B01 Combinatorics / 001A02B01A Classical combinatorial problems

Discipline
Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
19783807

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Searching the Web