Pages that link to "Item:Q1104756"

The following pages link to A random NC algorithm for depth first search (Q1104756):

Displaying 21 items.

• Extending planar graph algorithms to \(K_{3,3}\)-free graphs (Q582121) (← links)
• Recognition of DFS trees: Sequential and parallel algorithms with refined verifications (Q685690) (← links)
• A complexity theory of efficient parallel algorithms (Q913512) (← links)
• A parallel algorithm for recognizing unordered depth-first search (Q1111396) (← links)
• A parallel algorithm for the maximum 2-chain edge packing problem (Q1123636) (← links)
• An improvement of Goldberg, Plotkin and Vaidya's maximal node-disjoint paths algorithm (Q1124337) (← links)
• Parallel complexity of computing a maximal set of disjoint paths (Q1186594) (← links)
• A model classifying algorithms as inherently sequential with applications to graph searching (Q1187028) (← links)
• Not all planar digraphs have small cycle separators (Q1201868) (← links)
• Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs (Q1317488) (← links)
• A remark on maximum matching of line graphs (Q1377734) (← links)
• An optimal parallel algorithm for planar cycle separators (Q1900892) (← links)
• Designing checkers for programs that run in parallel (Q1911462) (← links)
• Frameworks for designing in-place graph algorithms (Q2237887) (← links)
• A 2-approximation NC algorithm for connected vertex cover and tree cover (Q2390219) (← links)
• Depth-First Search Using $$O(n)$$ Bits (Q2942660) (← links)
• Probabilistic analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph (Q3357536) (← links)
• The Recognition Problem of Graph Search Trees (Q4997136) (← links)
• A Framework for In-place Graph Algorithms (Q5009570) (← links)
• Improved parallel depth-first search in undirected planar graphs (Q5060132) (← links)
• Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier (Q5232328) (← links)