scientific article; zbMATH DE number 3876622

MaRDI QIDQ3341928zbMATH OpenFDO

Authors Maurizio Talamo, Marco Protasi

Publication date 1983

zbMATH Keywords

probabilistic algorithmsrandom graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)

Cited in

(5)

• A probabilistic algorithm for vertex connectivity of graphs
• A parametric analysis of the largest induced tree problem in random graphs
• scientific article; zbMATH DE number 1890147 (Why is no real title available?)
• Analysis of an Exhaustive Search Algorithm in Random Graphs and the $n^{c\log n}$-Asymptotics
• Guarantees for the success frequency of an algorithm for finding Dodgson-election winners

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 Q3341928)