Minimizing the jump number for partially ordered sets: A graph-theoretic approach
From MaRDI portal
Publication:1057887
DOI10.1007/BF00396269zbMath0564.06001OpenAlexW2082183871MaRDI QIDQ1057887
Publication date: 1984
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00396269
representationline digraphcyclomatic numberHasse diagramjump number problemN-free posetsroot digraph
Partial orders, general (06A06) Combinatorial identities, bijective combinatorics (05A19) Enumeration in graph theory (05C30) Representation theory of lattices (06B15) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items
Minimizing bumps in linear extensions of ordered sets ⋮ 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 ⋮ N-free posets as generalizations of series-parallel posets ⋮ Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II ⋮ An algorithm for solving the jump number problem ⋮ The setup polyhedron of series-parallel posets ⋮ Fast Detection of Stable and Count Predicates in Parallel Computations ⋮ Minimizing the maximum bump cost in linear extensions of a poset ⋮ A polynomially solvable case of optimal linear extension problem of a poset ⋮ The arboreal jump number of an order ⋮ A 3/2-approximation algorithm for the jump number of interval orders ⋮ Greedy balanced pairs in \(N\)-free ordered sets ⋮ Jump number maximization for proper interval graphs and series-parallel graphs ⋮ Minimizing setups in ordered sets of fixed width ⋮ Jump number problem: The role of matroids ⋮ On the greedy dimension of a partial order ⋮ Linear extensions of N-free orders.
Cites Work
This page was built for publication: Minimizing the jump number for partially ordered sets: A graph-theoretic approach
