Pages that link to "Item:Q3801100"
From MaRDI portal
The following pages link to Parallel algorithms for planar graph isomorphism and related problems (Q3801100):
Displaying 10 items.
- An external-memory depth-first search algorithm for general grid graphs (Q1022598) (← 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)
- An efficient parallel algorithm for the single function coarsest partition problem (Q1329732) (← links)
- An optimal parallel algorithm for planar cycle separators (Q1900892) (← links)
- Improved parallel depth-first search in undirected planar graphs (Q5060132) (← links)
- Topological recognition of polyhedral objects from multiple views (Q5940959) (← links)
- Distributed Testing of Graph Isomorphism in the CONGEST Model. (Q6084362) (← links)
