scientific article; zbMATH DE number 1500509
From MaRDI portal
Publication:4501524
zbMath0959.68048MaRDI QIDQ4501524
Meena Mahajan, Eric W. Allender
Publication date: 26 April 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (4)
The combinatorial approach yields an NC algorithm for computing Pfaffians ⋮ The complexity of planarity testing ⋮ The isomorphism problem for planar 3-connected graphs is in unambiguous logspace ⋮ Planarity Testing Revisited
This page was built for publication:
