Algorithms and Computation

DOI10.1007/11602613zbMath1173.68345OpenAlexW2304246803MaRDI QIDQ5897885

Martin Nehéz, Daniel Olejár

Publication date: 14 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11602613

zbMATH Keywords

random graphsdominating cliquesinterval routingadditive stretch routing scheme

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Threshold dominating cliques in random graphs and interval routing

This page was built for publication: Algorithms and Computation