scientific article; zbMATH DE number 219266

zbMath0768.68028MaRDI QIDQ4694753

Ingo Schiermeyer

Publication date: 29 June 1993

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

zbMATH Keywords

computational complexityrandom graphshamiltonian graphs\(k\)-closurefast sequential and parallel algorithmpolylog parallel algorithm

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45) Distributed algorithms (68W15)

Related Items (1)

A note on computing graph closures

This page was built for publication: