Pages that link to "Item:Q3378501"
From MaRDI portal
The following pages link to Algorithm and Experiments in Testing Planar Graphs for Isomorphism (Q3378501):
Displaying 7 items.
- The isomorphism problem for planar 3-connected graphs is in unambiguous logspace (Q1959391) (← links)
- Filtering graphs to check isomorphism and extracting mapping by using the conductance electrical model (Q2418739) (← links)
- (Q3735731) (← links)
- (Q3795244) (← links)
- (Q4729828) (← links)
- An algorithm for an 𝓁<sup>2</sup>-homological test for the planarity of a graph (Q4956221) (← links)
- Practical Experience with Hanani-Tutte for Testing c-Planarity (Q5232494) (← links)