scientific article; zbMATH DE number 3854438

MaRDI QIDQ3323285zbMATH OpenFDO

Authors Maurizio Talamo, Marco Protasi

Publication date 1983

zbMATH Keywords

combinatorial algorithmsdense graphsgreedy algorithmperformance of greedy strategiesprobabilistic analysis of algorithmsrandom graphsparse graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)

Recommendations

• scientific article; zbMATH DE number 3974320
• Experimental evaluation of the greedy and random algorithms for finding independent sets in random graphs
• Analysis of greedy algorithms on graphs with bounded degrees
• Probabilistic analysis of a parallel algorithm for finding maximal independent sets
• Independent sets in random sparse graphs

Cited in

(6)

• A probabilistic algorithm for vertex connectivity of graphs
• scientific article; zbMATH DE number 3974320 (Why is no real title available?)
• A fast random greedy algorithm for the component commonality problem
• Methodology for Stochastic Graph Completion-Time Problems
• 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

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