Isomorphism for digraphs and sequences of shop scheduling problems

MaRDI QIDQ2744381zbMATH OpenFDO

Authors Heidemarie Bräsel, Martin Harborth, Per Willenius

Publication date 19 September 2001

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

acyclic digraphscomplexitygraph isomorphismLatin rectanglesopen shop schedulingsequence graph

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 7145105
• Some recognition problems related to graph isomorphism
• scientific article; zbMATH DE number 3815
• The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs
• The isomorphism problem for classes of graphs closed under contraction

Cited in

(5)

• New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan
• The representation of partially-concurrent open shop problems
• scientific article; zbMATH DE number 7145105 (Why is no real title available?)
• scientific article; zbMATH DE number 7145128 (Why is no real title available?)
• Isomorphic scheduling problems

This page was built for publication: Isomorphism for digraphs and sequences of shop scheduling problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2744381)