Pages that link to "Item:Q3957959"
From MaRDI portal
The following pages link to Parallel Algorithms in Graph Theory: Planarity Testing (Q3957959):
Displayed 22 items.
- Parallel strong orientation of an undirected graph (Q789182) (← links)
- A parallel search algorithm for directed acyclic graphs (Q795509) (← links)
- Formula dissection: A parallel algorithm for constraint satisfaction (Q931750) (← links)
- A note on finding minimum cuts in directed planar networks by parallel computations (Q1069429) (← links)
- Finding small simple cycle separators for 2-connected planar graphs (Q1085169) (← links)
- Parallel ear decomposition search (EDS) and st-numbering in graphs (Q1095666) (← links)
- Parallel O(log n) time edge-colouring of trees and Halin graphs (Q1107328) (← links)
- An efficient parallel algorithm for planarity (Q1114415) (← links)
- NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems (Q1120597) (← links)
- Parallel computation and conflicts in memory access (Q1171382) (← links)
- Fast algorithms for lowest common ancestors on a processor array with reconfigurable buses (Q1183475) (← links)
- A new graph triconnectivity algorithm and its parallelization (Q1193533) (← links)
- Topological queries in spatial databases (Q1305920) (← links)
- Planarity testing in parallel (Q1342859) (← links)
- The complexity of planarity testing (Q1887150) (← links)
- An efficient parallel algorithm for finding rectangular duals of plane triangular graphs (Q1892581) (← links)
- On the complexity of the stability problem of binary freezing totalistic cellular automata (Q2201794) (← links)
- Planarity Testing Revisited (Q3010433) (← links)
- Parallel computations on graphs (Q3221400) (← links)
- NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs (Q4994988) (← links)
- Parallel dynamic lowest common ancestors (Q5054770) (← links)
- Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata (Q6163609) (← links)