Pages that link to "Item:Q3034839"

The following pages link to Parallel Depth-First Search in General Directed Graphs (Q3034839):

Displaying 17 items.

• A linear time algorithm for finding depth-first spanning trees on trapezoid graphs (Q287118) (← links)
• A randomized NC algorithm for the maximal tree cover problem (Q1183479) (← 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)
• Parallel search algorithms for graphs and trees (Q1204800) (← links)
• Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs (Q1317488) (← links)
• Size-estimation framework with applications to transitive closure and reachability (Q1384531) (← links)
• An optimal parallel algorithm for planar cycle separators (Q1900892) (← links)
• Fault tolerant depth first search in undirected graphs: simple yet efficient (Q2149103) (← links)
• Depth-first search in directed planar graphs, revisited (Q2170277) (← links)
• Frameworks for designing in-place graph algorithms (Q2237887) (← links)
• Bipartite Perfect Matching is in Quasi-NC (Q4997314) (← links)
• A Framework for In-place Graph Algorithms (Q5009570) (← links)
• Improved parallel depth-first search in undirected planar graphs (Q5060132) (← links)
• (Q5092428) (← links)
• Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier (Q5232328) (← links)