THE DEPRIORITISED APPROACH TO PRIORITISED ALGORITHMS

DOI10.1017/S0004972709000410zbMATH Open1182.05111MaRDI QIDQ3633341FDOQ3633341

Authors: Stephen Howe 

Publication date: 18 June 2009

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

dominating setsrandomised algorithmsrandom regular digraphsdeprioritised algorithms

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80) Randomized algorithms (68W20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Analysis of greedy algorithms on graphs with bounded degrees
• Bounds on the bisection width for random \(d\)-regular graphs
• On the Independent Domination Number of Random Regular Graphs
• Packing vertices and edges in random regular graphs

This page was built for publication: THE DEPRIORITISED APPROACH TO PRIORITISED ALGORITHMS

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