scientific article; zbMATH DE number 3990867

MaRDI QIDQ3753485zbMATHFDO

Authors Daniel Olejár

Publication date 1986

zbMATH Keywords

compressibilityBoolean matricesdata processing methodsDF-algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Improving the efficiency of depth-first search by cycle elimination
• scientific article; zbMATH DE number 3949734
• A note on parallel depth first search
• Depth-First Search Using $$O(n)$$ Bits
• Parallel algorithms for a depth first search and a breadth first search
• scientific article; zbMATH DE number 1069483
• A new distributed depth-first-search algorithm
• scientific article; zbMATH DE number 3858437
• Depth-first search in directed planar graphs, revisited

Cited in

(3)

• Depth First Search in the Semi-streaming Model
• Depth-First Search Using $$O(n)$$ Bits
• The average complexity of depth-first search with backtracking and cutoff

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