Pages that link to "Item:Q2648578"
From MaRDI portal
The following pages link to A decomposition theorem for partially ordered sets (Q2648578):
Displayed 50 items.
- Using formal verification to evaluate the execution time of Spark applications (Q782497) (← links)
- Distributive Cauchy lattices (Q793765) (← links)
- Uniqueness of linear extensions of partial orders (Q795070) (← links)
- Enumerating fuzzy switching functions and free Kleene algebras (Q796494) (← links)
- On the computational complexity of path cover problems (Q799105) (← links)
- Path-closed sets (Q802569) (← links)
- Finite cutsets and finite antichains (Q802580) (← links)
- On the size of jump-critical ordered sets (Q802585) (← links)
- On partitions and presortedness of sequences (Q808689) (← links)
- A bound for the Dilworth number (Q809096) (← links)
- Kolmogorov complexities \(K_{\max}\), \(K_{\min}\) on computable partially ordered sets (Q818126) (← links)
- Empty monochromatic triangles (Q833720) (← links)
- Algorithms for some graph theoretical optimization problems (abstract of thesis) (Q862821) (← links)
- A bipartite analogue of Dilworth's theorem (Q862983) (← links)
- A structure theorem for posets admitting a ``strong'' chain partition: a generalization of a conjecture of Daykin and Daykin (with connections to probability correlation inequalities) (Q864160) (← links)
- Approximate min-max relations for odd cycles in planar graphs (Q877199) (← links)
- Alternating paths along axis-parallel segments (Q882782) (← links)
- New bounds on the maximum number of edges in \(k\)-quasi-planar graphs (Q904085) (← links)
- Generalized Robinson-Schensted-Knuth correspondence (Q912095) (← links)
- Some order dimension bounds for communication complexity problems (Q921909) (← links)
- On the complexity of dynamic programming for sequencing problems with precedence constraints (Q922284) (← links)
- Partitioning a weighted partial order (Q927191) (← links)
- Binary relations: Finite characterizations and computational complexity (Q935039) (← links)
- Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture (Q949757) (← links)
- Finding common structured patterns in linear graphs (Q974741) (← links)
- A Nice labelling for tree-like event structures of degree 3 (Q979077) (← links)
- Utility representation of lower separable preferences (Q1005751) (← links)
- Optimal conclusive sets for comparator networks (Q1008736) (← links)
- Property \(A\) and \(\text{CAT}(0)\) cube complexes. (Q1011433) (← links)
- Duality for semiantichains and unichain coverings in products of special posets (Q1013994) (← links)
- Computational complexity of some scheduling problems with multiprocessor tasks (Q1019301) (← links)
- A bipartite analogue of Dilworth's theorem for multiple partial orders (Q1041604) (← links)
- A polynomial bound for untangling geometric planar graphs (Q1042452) (← links)
- Perfectness and imperfectness of unit disk graphs on triangular lattice points (Q1043621) (← links)
- On geometric graph Ramsey numbers (Q1043821) (← links)
- How to derive finite semimodular lattices from distributive lattices? (Q1046765) (← links)
- The Sperner property for posets: A probabilistic approach (Q1057860) (← links)
- Networks and chain coverings in partial orders and their products (Q1059648) (← links)
- Inequalities for the greedy dimensions of ordered sets (Q1065837) (← links)
- On the complexity of a family of generalized matching problems (Q1068535) (← links)
- ``Poly-unsaturated'' posets: The Greene-Kleitman theorem is best possible (Q1069961) (← links)
- Decomposing a set of points into chains, with applications to permutation and circle graphs (Q1071505) (← links)
- Some sequences associated with combinatorial structures (Q1073032) (← links)
- Maximum-sized antichains in minimal posets (Q1081623) (← links)
- Polyhedral proof methods in combinatorial optimization (Q1082268) (← links)
- On k-optimum dipath partitions and partial k-colourings of acyclic digraphs (Q1082350) (← links)
- Decomposing weighted digraphs into sums of chains (Q1084404) (← links)
- Monochromatic directed walks in arc-colored directed graphs (Q1088681) (← links)
- Alternating orientation and alternating colouration of perfect graphs (Q1089007) (← links)
- A note on Dilworth's theorem in the infinite case (Q1093655) (← links)