scientific article
From MaRDI portal
Publication:3329227
zbMath0541.90077MaRDI QIDQ3329227
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
combinatorial optimizationbipartite sum of ordered setsseries-parallel connections of ordered setsstrongly greedy ordered sets
Related Items (5)
On some complexity properties of N-free posets and posets with bounded decomposition diameter ⋮ A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders ⋮ On finding the jump number of a partial order by substitution decomposition ⋮ Jump number problem: The role of matroids ⋮ On the greedy dimension of a partial order
This page was built for publication: