| ISBN |
9789400953154 |
| 기타 표준번호 |
10.1007/978-94-009-5315-4 |
| 청구기호 |
QA172-172.4 |
| 다른형태 서명 |
Proceedings of the NATO Advanced Study Institute, Banff, Canada, May 18-31, 1984
|
| 형태사항 |
816 p. online resource.
|
| 언어 |
English |
| 내용 |
I. Graph Representations -- Comparability graphs -- Algorithmic aspects of comparability graphs and interval graphs -- The diagram -- II. Scheduling, Searching and Sorting -- The information theoretic bound for problems on ordered sets and graphs -- Sorting and graphs -- A graph-theoretic approach to the jump-number problem -- Acyclic subdigraphs and linear orderings: polytopes, facets, and a cutting plane algorithm -- III. Extremal Orders -- Parameters of partial orders and graphs: packing, covering and representation -- Graphs and orders in Ramsey theory and in dimension theory -- Ordered ranked posets, representations of integers and inequalities from extremal poset problems -- IV. Social Sciences -- Issues in the theory of uniqueness in measurement -- V. Decomposition -- Path-partitions in directed graphs and posets -- VI. Recursion -- Recursion theoretic aspects of graphs and orders -- VII. Well-Quasi-Ordering -- Basic wqo- and bqo-theory -- Applications of well quasi-ordering and better quasi-ordering -- VIII. Problem Sessions -- Enumeration -- The diagram -- Ramsey theory -- Sorting, scheduling, computing, operations research, and social science -- Structure theories -- Infinite sets and infinite graphs -- Souvenir session -- Order-preserving and edge-preserving maps -- Miscellaneous -- IX. A Bibliography -- X. Index.
|
| 주제 |
Mathematics.
Computer science --Mathematics.
Algebra.
Ordered algebraic structures.
Mathematics.
Order, Lattices, Ordered Algebraic Structures.
Discrete Mathematics in Computer Science.
|
| 보유판 및 특별호 저록 |
Springer eBooks
Printed edition: 9789401088480
|
| QR CODE |
|
