scientific article; zbMATH DE number 3400905

From MaRDI portal

Revision as of 04:24, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5668808

Jump to:navigation, search

zbMath0254.05001MaRDI QIDQ5668808

John E. Hopcrofts, Robert Endre Tarjan

Publication date: 1972

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (05Cxx) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (3)

On the time required to detect cycles and connectivity in graphs ⋮ \(A\,V^ 2\) algorithm for determining isomorphism of planar graphs ⋮ Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5668808&oldid=30364563"