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

DOI10.1051/ro/1984180302471zbMath0546.68045OpenAlexW2466548671MaRDI QIDQ3336709

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)

Related Items (1)

Efficient polynomial algorithms for distributive lattices

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