Pages that link to "Item:Q4050114"
From MaRDI portal
The following pages link to Finding Dominators in Directed Graphs (Q4050114):
Displaying 30 items.
- A quadratic algorithm for finding next-to-shortest paths in graphs (Q639280) (← links)
- Generalized dominators (Q674182) (← links)
- A simple version of Karzanov's blocking flow algorithm (Q795064) (← links)
- A parallel search algorithm for directed acyclic graphs (Q795509) (← links)
- Pseudo-recursive procedures (Q1057638) (← links)
- On efficient parallel strong orientation (Q1082819) (← links)
- Rectilinear planar layouts and bipolar orientations of planar graphs (Q1085168) (← links)
- Notes on oriented depth-first search and longest paths (Q1118610) (← links)
- Depth-first K-trees and critical path analysis (Q1138380) (← links)
- Pathlistings applied to data flow analysis (Q1155957) (← links)
- st-ordering the vertices of biconnected graphs (Q1167194) (← links)
- Efficient parallel algorithms for path problems in directed graphs (Q1186791) (← links)
- Parallel search algorithms for graphs and trees (Q1204800) (← links)
- A new algorithm for finding weak components (Q1214260) (← links)
- Edge-disjoint spanning trees and depth-first search (Q1217713) (← links)
- Testing flow graph reducibility (Q1221484) (← links)
- Correctness of parallel programs: The Church-Rosser approach (Q1241051) (← links)
- A linear-time algorithm for finding all feedback vertices (Q1250830) (← links)
- A uniform approach to semi-dynamic problems on digraphs (Q1274321) (← links)
- Self-stabilizing depth-first token circulation on networks (Q1310571) (← links)
- A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs (Q1322567) (← links)
- Minimization algorithms for sequential transducers (Q1575676) (← links)
- 2-vertex connectivity in directed graphs (Q1640998) (← links)
- An \(O(| V|^*| E|)\) algorithm for finding immediate multiple-vertex dominators (Q1847358) (← links)
- Concurrent disjoint set union (Q2064053) (← links)
- Dijkstra graphs (Q2414453) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- Dynamic Dominators and Low-High Orders in DAGs (Q5075793) (← links)
- Depth First Search in the Semi-streaming Model (Q5090492) (← links)
- (Q5092430) (← links)
