Publication:4200070
From MaRDI portal
zbMath0413.05013MaRDI QIDQ4200070
No author found.
Publication date: 1979
Full work available at URL: https://eudml.org/doc/92089
68R10: Graph theory (including graph drawing) in computer science
05C20: Directed graphs (digraphs), tournaments
05-04: Software, source code, etc. for problems pertaining to combinatorics
Related Items
NP-completeness properties about linear extensions, Jump number of dags having Dilworth number 2, Minimizing completion time for a class of scheduling problems, On the greedy dimension of a partial order, Jump number problem: The role of matroids, Minimizing the jump number for partially ordered sets: A graph-theoretic approach, Greedy linear extensions to minimize jumps, A setup heuristic for interval orders, An algorithm for minimizing setups in precedence constrained scheduling, Interval orders without odd crowns are defect optimal, On some complexity properties of N-free posets and posets with bounded decomposition diameter, Constructing greedy linear extensions by interchanging chains, NP-completeness results concerning greedy and super greedy linear extensions, 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, Greedy posets for the bump-minimizing problem, Substitution and atomic extension on greedy posets, On minimizing jumps for ordered sets, The jump number of Z-free ordered sets, The setup polyhedron of series-parallel posets, Greedy linear extensions with constraints, A linear algorithm to decompose inheritance graphs into modules, Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings, Minimizing Setups for Ordered Sets: A Linear Algebraic Approach, Optimal Linear Extensions by Interchanging Chains, Minimizing Setups for Cycle-Free Ordered Sets
Cites Work
