Pages that link to "Item:Q1062456"

The following pages link to Depth-first search is inherently sequential (Q1062456):

Displaying 50 items.

• The incremental maintenance of a depth-first-search tree in directed acyclic graphs (Q286984) (← links)
• The lexicographically first topological order problem is NLOG-complete (Q582104) (← links)
• Recognition of DFS trees: Sequential and parallel algorithms with refined verifications (Q685690) (← links)
• On the complexity of topological sorting (Q750150) (← links)
• A complexity theory of efficient parallel algorithms (Q913512) (← links)
• A P-complete graph partition problem (Q917313) (← links)
• On efficient parallel strong orientation (Q1082819) (← links)
• A parallel algorithm for the maximal path problem (Q1100916) (← links)
• Fast parallel graph searching with applications (Q1103409) (← links)
• A random NC algorithm for depth first search (Q1104756) (← links)
• A topological approach to dynamic graph connectivity (Q1108030) (← links)
• The multi-tree approach to reliability in distributed networks (Q1109560) (← links)
• A parallel algorithm for the maximum 2-chain edge packing problem (Q1123636) (← links)
• \(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems (Q1177173) (← links)
• Efficient parallel algorithms for path problems in directed graphs (Q1186791) (← links)
• A model classifying algorithms as inherently sequential with applications to graph searching (Q1187028) (← links)
• Parallel search algorithms for graphs and trees (Q1204800) (← links)
• Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs (Q1317488) (← links)
• A theory of strict P-completeness (Q1337145) (← links)
• Distributed algorithms for depth-first search (Q1349993) (← links)
• Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM (Q1356881) (← links)
• Some remarks on distributed depth-first search. (Q1853008) (← links)
• An optimal parallel algorithm for planar cycle separators (Q1900892) (← links)
• Concurrent disjoint set union (Q2064053) (← links)
• A linear-time certifying algorithm for recognizing generalized series-parallel graphs (Q2104935) (← links)
• Depth-first search in directed planar graphs, revisited (Q2170277) (← links)
• Symbolic coloured SCC decomposition (Q2233494) (← links)
• Frameworks for designing in-place graph algorithms (Q2237887) (← links)
• On parallelizing a greedy heuristic for finding small dominant sets (Q2366651) (← links)
• On the parallel computation of the biconnected and strongly connected co-components of graphs (Q2383544) (← links)
• A variable neighborhood search for the network design problem with relays (Q2403270) (← links)
• Incremental algorithm for maintaining a DFS tree for undirected graphs (Q2408922) (← links)
• A multi-threading algorithm to detect and remove cycles in vertex- and arc-weighted digraph (Q2633178) (← links)
• Dynamical modeling and analysis of large cellular regulatory networks (Q2787874) (← links)
• A Stack-Slicing Algorithm for Multi-Core Model Checking (Q2866322) (← links)
• Depth-First Search Using $$O(n)$$ Bits (Q2942660) (← links)
• On Dynamic DFS Tree in Directed Graphs (Q2946380) (← links)
• THE TRANSITIVE CLOSURE AND RELATED ALGORITHMS OF DIGRAPH ON THE RECONFIGURABLE ARCHITECTURE (Q3144916) (← links)
• An 0(log n) parallel algorithm for strong connectivity augmentation problem (Q3804208) (← links)
• Parallel algorithms on interval graphs (Q4359285) (← links)
• The lexicographically first maximal subgraph problems:P-completeness andNC algorithms (Q4729355) (← links)
• The Recognition Problem of Graph Search Trees (Q4997136) (← links)
• A Framework for In-place Graph Algorithms (Q5009570) (← links)
• Automated Verification of Parallel Nested DFS (Q5039512) (← links)
• Improved parallel depth-first search in undirected planar graphs (Q5060132) (← links)
• (Q5092428) (← links)
• (Q5094123) (← links)
• A theory of strict P-completeness (Q5096767) (← links)
• Digital Bifurcation Analysis of Internet Congestion Control Protocols (Q5138291) (← links)
• Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier (Q5232328) (← links)