Pages that link to "Item:Q1103409"
From MaRDI portal
The following pages link to Fast parallel graph searching with applications (Q1103409):
Displaying 13 items.
- Fast-mixed searching and related problems on graphs (Q393051) (← links)
- Algorithms for some graph problems on a distributed computational model (Q580985) (← links)
- An adaptive parallel algorithm for analyzing activity networks (Q910339) (← links)
- An improvement of Goldberg, Plotkin and Vaidya's maximal node-disjoint paths algorithm (Q1124337) (← links)
- A unified approach to parallel depth-first traversals of general trees (Q1178197) (← links)
- Finding maximum matching for bipartite graphs in parallel (Q1342094) (← links)
- Parallel algorithms for flexible pattern matching on big graphs (Q2195447) (← links)
- Sequential and parallel solution-biased search for subgraph algorithms (Q2327237) (← links)
- (Q3186846) (← links)
- (Q3801091) (← links)
- FAST PARALLEL ALGORITHMS FOR FINDING CUTPOINTS AND BRIDGES OF UNDIRECTED GRAPHS (Q4820006) (← links)
- (Q5472917) (← links)
- Polynomially improved efficiency for fast parallel single-source lexicographic depth-first search, breadth-first search, and topological-first search (Q5949570) (← links)