The absolute center of a network
From MaRDI portal
Publication:4458724
DOI10.1002/net.10108zbMath1069.68016OpenAlexW2060208149MaRDI QIDQ4458724
Publication date: 15 March 2004
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.10108
Related Items (10)
Network search games, with arbitrary searcher starting point ⋮ Hide-and-seek games on a tree to which Eulerian networks are attached ⋮ Kinetic Maintenance of Mobile k-Centres on Trees ⋮ Network search games with immobile hider, without a designated searcher starting point ⋮ Unnamed Item ⋮ Fast payment schemes for truthful mechanisms with verification ⋮ Delay-constrained minimum shortest path trees and related problems ⋮ Delay-constrained minimum shortest path trees and related problems ⋮ Fast approximation of eccentricities and distances in hyperbolic graphs ⋮ Kinetic maintenance of mobile \(k\)-centres on trees
Cites Work
This page was built for publication: The absolute center of a network