On some complexity properties of N-free posets and posets with bounded decomposition diameter
From MaRDI portal
Publication:1086264
Recommendations
- On the diameter and girth of zero-divisor graphs of posets
- The Complexity of the Extendibility Problem for Finite Posets
- Nonuniform complexity classes, decision graphs and homological properties of posets
- Progress on poset-free families of subsets
- Computing the dimension of N-free ordered sets is NP-complete
- On the dimension of posets with cover graphs of treewidth 2
- scientific article; zbMATH DE number 3995740
- Improved bound for the dimension of posets of treewidth two
- On the complexity of cover-incomparability graphs of posets
- scientific article; zbMATH DE number 1759433
Cites work
- scientific article; zbMATH DE number 3860892 (Why is no real title available?)
- scientific article; zbMATH DE number 3877241 (Why is no real title available?)
- scientific article; zbMATH DE number 3896963 (Why is no real title available?)
- scientific article; zbMATH DE number 3906240 (Why is no real title available?)
- scientific article; zbMATH DE number 3908482 (Why is no real title available?)
- scientific article; zbMATH DE number 3675952 (Why is no real title available?)
- scientific article; zbMATH DE number 3757695 (Why is no real title available?)
- scientific article; zbMATH DE number 3786844 (Why is no real title available?)
- scientific article; zbMATH DE number 3485834 (Why is no real title available?)
- scientific article; zbMATH DE number 3558962 (Why is no real title available?)
- scientific article; zbMATH DE number 3641455 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- scientific article; zbMATH DE number 3893249 (Why is no real title available?)
- scientific article; zbMATH DE number 3894817 (Why is no real title available?)
- scientific article; zbMATH DE number 3218572 (Why is no real title available?)
- A Fast Algorithm for the Decomposition of Graphs and Posets
- A V log V algorithm for isomorphism of triconnected planar graphs
- A labeling algorithm to recognize a line digraph and output its root graph
- A structured program to generate all topological sorting arrangements
- Almost all comparability graphs are UPO
- Asymptotic Enumeration of Partial Orders on a Finite Set
- Complement reducible graphs
- Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
- Linear-time computability of combinatorial problems on series-parallel graphs
- Linear-time computation of optimal subgraphs of decomposable graphs
- Maximal chains and antichains
- Minimizing Setups for Ordered Sets: A Linear Algebraic Approach
- Minimizing the jump number for partially ordered sets: A graph-theoretic approach
- N-free posets as generalizations of series-parallel posets
- On the X-join decomposition for undirected graphs
- Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions
- Ordres "C.A.C."
- Partially Ordered Sets
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- The Complexity of the Partial Order Dimension Problem
- The Jump Number of Dags and Posets: An Introduction
- Topology of series-parallel networks
Cited in
(22)- On the computational complexity of the order polynomial
- Efficient polynomial algorithms for distributive lattices
- N-free posets as generalizations of series-parallel posets
- Relative Ockham lattices: their order-theoretic and algebraic characterisation
- Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II
- An algorithm for solving the jump number problem
- On some new types of greedy chains and greedy linear extensions of partially ordered sets
- Cross-series-parallel digraphs
- On the structure of trapezoid graphs
- Counting linear extensions
- Linear extensions of N-free orders.
- Transitive closure for restricted classes of partial orders
- Regularity of residuated mappings
- Triangulating multitolerance graphs
- On the Jump Number of Lexicographic Sums of Ordered Sets
- PLA folding in special graph classes
- Counting Cherry reduction sequences in phylogenetic tree-child networks is counting linear extensions
- The arboreal jump number of an order
- New bijective links on planar maps via orientations
- Asymptotic enumeration of N-free partial orders
- \(N\)-free orders and minimal interval extensions
- Counting linear extensions: parameterizations by treewidth
This page was built for publication: On some complexity properties of N-free posets and posets with bounded decomposition diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1086264)
