scientific article; zbMATH DE number 108586

MaRDI QIDQ4024058zbMATH OpenFDO

Authors Ralf Hartmut Gueting

Publication date 23 January 1993

zbMATH Keywords

algorithmscomplexitycomputational geometry

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Analysis of algorithms and problem complexity (68Q25)

Cited in

(10)

• A simplified correctness proof for a well-known algorithm computing strongly connected components.
• scientific article; zbMATH DE number 4013990 (Why is no real title available?)
• scientific article; zbMATH DE number 4039247 (Why is no real title available?)
• scientific article; zbMATH DE number 42919 (Why is no real title available?)
• scientific article; zbMATH DE number 43786 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 839549 (Why is no real title available?)
• scientific article; zbMATH DE number 1412401 (Why is no real title available?)
• Codeless Data Structures and Algorithms
• Certificates in Data Structures

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4024058)