scientific article; zbMATH DE number 3896963
From MaRDI portal
Publication:3676161
zbMATH Open0563.05029MaRDI QIDQ3676161FDOQ3676161
Authors: Maciej M. Sysło
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
- Minimizing the jump number for partially ordered sets: A graph-theoretic approach
- Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II
- An algorithm for solving the jump number problem
- scientific article; zbMATH DE number 764417
- An optimal algorithm to find the jump number of partially ordered sets
Directed graphs (digraphs), tournaments (05C20) Partial orders, general (06A06) Analysis of algorithms and problem complexity (68Q25)
Cited In (23)
- Title not available (Why is that?)
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems
- Parallel \(N\)-free order recognition
- Title not available (Why is that?)
- Minimizing setups in ordered sets of fixed width
- On the jump number problem in hereditary classes of bipartite graphs
- Minimizing the jump number for partially ordered sets: A graph-theoretic approach
- Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II
- An algorithm for solving the jump number problem
- Alternating cycle-free matchings
- On some new types of greedy chains and greedy linear extensions of partially ordered sets
- Computing the jump number on semi-orders is polynomial
- The jump number problem on interval orders: A 3/2 approximation algorithm
- Height counting of unlabeled interval and \(N\)-free posets.
- Examples of Jump-Critical Ordered Sets
- Generating linear extensions of posets by transpositions
- The arboreal jump number of an order
- On the Parameterized Complexity for Token Jumping on Graphs
- Greedy posets for the bump-minimizing problem
- Title not available (Why is that?)
- Review of properties of different precedence graphs for scheduling problems
- Jump number problem: The role of matroids
- On some complexity properties of N-free posets and posets with bounded decomposition diameter
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3676161)