Algorithmic combinatorics based on slicing posets

DOI10.1016/j.tcs.2006.03.005zbMath1100.05043OpenAlexW2028661725MaRDI QIDQ2503297

Vijay K. Garg

Publication date: 14 September 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.03.005

zbMATH Keywords

algorithmdistributive latticesBirkhoff's theoremorder ideals of digraphs

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07) Structure and representation theory of distributive lattices (06D05) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Characterizing isometries on the order polytope with an application to the theory of fuzzy measures ⋮ Adjacency on the order polytope with applications to the theory of fuzzy measures ⋮ Unified mathematical framework for slicing and symmetry reduction over event structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A CAT algorithm for generating permutations with a fixed number of inversions
• An algorithm to generate the ideals of a partial order
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Single Machine Scheduling with Precedence Constraints of Dimension 2
• On Comparability and Permutation Graphs
• Searching in Trees, Series-Parallel and Interval Orders

This page was built for publication: Algorithmic combinatorics based on slicing posets