Diamètre de graphes et qualité de service d'un réseau de données

DOI10.1051/RO/1984180302471MaRDI QIDQ3336709zbMATH OpenOpenAlexFDO

Authors M. E. Lesk

Publication date 1984

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/104856

zbMATH Keywords

diameter of graphsservice constraints in data networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• scientific article; zbMATH DE number 3959292
• Diameters of random circulant graphs
• scientific article; zbMATH DE number 205764
• Diameter vulnerability of directed cycles and directed tori
• scientific article; zbMATH DE number 1107739

Cited in

(2)

• Efficient polynomial algorithms for distributive lattices
• scientific article; zbMATH DE number 3959292 (Why is no real title available?)

This page was built for publication: Diamètre de graphes et qualité de service d'un réseau de données

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