scientific article

zbMATH Open0612.68040MaRDI QIDQ3753485FDOQ3753485

Daniel Olejár

Publication date: 1986

Title of this publication is not available (Why is that?)

zbMATH Keywords

compressibilityBoolean matricesdata processing methodsDF-algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (3)

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

   Recommendations

• Improving the efficiency of depth-first search by cycle elimination 👍 👎
• Title not available (Why is that?) 👍 👎
• 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 👍 👎
• Title not available (Why is that?) 👍 👎
• A new distributed depth-first-search algorithm 👍 👎
• Title not available (Why is that?) 👍 👎
• Depth-first search in directed planar graphs, revisited 👍 👎

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)