Pages that link to "Item:Q1288544"
From MaRDI portal
The following pages link to A simple \(O(\log N)\) time parallel algorithm for testing isomorphism of maximal outerplanar graphs (Q1288544):
Displaying 4 items.
- An optimal simple parallel algorithm for testing isomorphism of maximal outerplanar graphs (Q1604311) (← links)
- (Q3795244) (← links)
- Parallel Algorithm for Solving the Graph Isomorphism Problem (Q5060056) (← links)
- Bounds of spectral radii on edge-most outer-planar bipartite graphs (Q5300063) (← links)