A Graph-Theoretic Approach to the Jump-Number Problem

This publication has 21 references indexed in Scilit:

• Optimal constructions of reversible digraphs
  Discrete Applied Mathematics, 1984
• Minimizing Setups for Ordered Sets: A Linear Algebraic Approach
  SIAM Journal on Algebraic Discrete Methods, 1983
• Optimal linear extensions by interchanging chains
  Proceedings of the American Mathematical Society, 1983
• A labeling algorithm to recognize a line digraph and output its root graph
  Information Processing Letters, 1982
• Minimizing setups for cycle-free ordered sets
  Proceedings of the American Mathematical Society, 1982
• Complexity of the minimum‐dummy‐activities problem in a pert network
  Networks, 1979
• Minimal event-node network of project precedence relations
  Communications of the ACM, 1973
• On direction-preserving maps of graphs
  Journal of Combinatorial Theory, 1969
• Computer construction of project networks
  Communications of the ACM, 1968
• A Decomposition Theorem for Partially Ordered Sets
  Annals of Mathematics, 1950