The Calculation of Invariants for Ordered Sets
- 1 January 1989
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 63 references indexed in Scilit:
- Searching in 2-dimensional partial ordersJournal of Algorithms, 1987
- On the computational complexity of the order polynomialDiscrete Applied Mathematics, 1986
- Planar 3DM is NP-completeJournal of Algorithms, 1986
- Minimizing setups for cycle-free ordered setsProceedings of the American Mathematical Society, 1982
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1981
- A Combinatorial Decomposition TheoryCanadian Journal of Mathematics, 1980
- On the X-join decomposition for undirected graphsDiscrete Applied Mathematics, 1979
- A structured program to generate all topological sorting arrangementsInformation Processing Letters, 1974
- Transitiv orientierbare GraphenActa Mathematica Hungarica, 1967
- Graph derivativesMathematische Zeitschrift, 1961