Tight approximation algorithms for bichromatic graph diameter and related problems
© Graham Cormode, Jacques Dark, and Christian Konrad; licensed under Creative Commons License CC-BY Some of the most fundamental and well-studied graph parameters are the Diameter (the largest shortest paths distance) and Radius (the smallest distance for which a “center” node can reach all other no...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
2021
|
| Online Access: | https://hdl.handle.net/1721.1/137631 |