Maximal Intersection Queries in Randomized Graph Models

DOI10.1007/978-3-540-74510-5_24MaRDI QIDQ3499778zbMATH OpenOpenAlexFDO

Authors Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka

Publication date 3 June 2008

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74510-5_24

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• Maximal intersection queries in randomized input models
• Large independent sets in general random intersection graphs
• Automata, Languages and Programming
• Stochastic Algorithms: Foundations and Applications
• A Linear Time Approach to the Set Maxima Problem

Cited in

(1)

• Maximal intersection queries in randomized input models

This page was built for publication: Maximal Intersection Queries in Randomized Graph Models

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