The following pages link to The absolute center of a network (Q4458724):
Displaying 17 items.
- The continuous center set of a network (Q757234) (← links)
- The absolute centre of a graph (Q793644) (← links)
- Network search games with immobile hider, without a designated searcher starting point (Q933761) (← links)
- Fast payment schemes for truthful mechanisms with verification (Q1006066) (← links)
- Kinetic maintenance of mobile \(k\)-centres on trees (Q1028114) (← links)
- Group centre and group median of a network (Q1123113) (← links)
- An algorithm for finding the absolute center of a network (Q1173797) (← links)
- Locating an absolute center on graphs that are almost trees (Q1263510) (← links)
- Network search games, with arbitrary searcher starting point (Q3184600) (← links)
- Hide-and-seek games on a tree to which Eulerian networks are attached (Q3184601) (← links)
- A polynomial time algorithm for finding the absolute center of a network (Q4000529) (← links)
- Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
- (Q5091199) (← links)
- Kinetic Maintenance of Mobile k-Centres on Trees (Q5387769) (← links)
- Delay-constrained minimum shortest path trees and related problems (Q5918729) (← links)
- Delay-constrained minimum shortest path trees and related problems (Q5925589) (← links)
- Finding broadcast 2-centers of a tree under the postal model (Q6585258) (← links)
