Generating all arcs in the transitive closure of a directed hypergraph

スポンサーリンク

概要

• 論文の詳細を見る
• 北陸先端科学技術大学院大学の論文
• 1998-04-24

著者

• Cepek Ondrej

  School of Information Science Japan Advanced Institute of Science and Technology-Hokuriku

• Cepek Ondrej

  School Of Information Science Japan Advanced Institute Of Scienece And Technology Hokuriku

関連論文

• Minimizing total completion time in a two-machine no-idle flowshop
• Nonpreemtive flowshop scheduling with machine dominance
• Generating all arcs in the transitive closure of a directed hypergraph

スポンサーリンク