scientific article; zbMATH DE number 166022

MaRDI QIDQ4033675zbMATH OpenFDO

Authors Günter Bieß, Manfred Bautz

Publication date 16 May 1993

zbMATH Keywords

finite digraphsheuristical polynomial algorithmorbits

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Directed circuits on a torus
• A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs
• A heuristic algorithm of recognition of isomorphism of graphs
• On digraphs with circulant adjacent matrices
• Enumeration of Hamiltonian circuits in digraphs

Cited in

(4)

• Directed circuits on a torus
• scientific article; zbMATH DE number 4162908 (Why is no real title available?)
• scientific article; zbMATH DE number 4101227 (Why is no real title available?)
• scientific article; zbMATH DE number 15657 (Why is no real title available?)

Describes a project that uses

Uses Software

• Turbo Pascal

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 Q4033675)