Scheduling problems
From MaRDI portal
Publication:899491
DOI10.1016/j.jcta.2015.11.001zbMath1328.05190arXiv1401.2978MaRDI QIDQ899491
Felix Breuer, Caroline J. Klivans
Publication date: 28 December 2015
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.2978
05E05: Symmetric functions and generalizations
68R10: Graph theory (including graph drawing) in computer science
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Unnamed Item, Hopf Monoids and Generalized Permutahedra, Chromatic symmetric functions of hypertrees, Resolving Stanley's \(e\)-positivity of claw-contractible-free graphs, Quasisymmetric and Schur expansions of cycle index polynomials, New invariants for permutations, orders and graphs, Möbius inversion as duality for Hopf monoids, Plurigraph coloring and scheduling problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hypergraph coloring complexes
- Bounds on the coefficients of tension and flow polynomials
- Triangulations. Structures for algorithms and applications
- A quasisymmetric function for matroids
- A symmetric function generalization of the chromatic polynomial of a graph
- On posets and Hopf algebras
- Ehrhart \(f^*\)-coefficients of polytopal complexes are non-negative integers
- Coloring complexes and arrangements
- Inside-out polytopes
- The Bergman complex of a matroid and phylogenetic trees
- THE HOPF ALGEBRAS OF SYMMETRIC FUNCTIONS AND QUASI-SYMMETRIC FUNCTIONS IN NON-COMMUTATIVE VARIABLES ARE FREE AND CO-FREE
- Lectures on Polytopes
- Viewing counting polynomials as Hilbert functions via Ehrhart theory
- Ordered structures and partitions
- Shellable Decompositions of Cells and Spheres.
- Combinatorial reciprocity theorems
- A chromatic symmetric function in noncommuting variables
- The coloring ideal and coloring complex of a graph
