An Optimal Algorithm to flnd Centres and Diameter of a Circular-Arc Graph
Swagata Mandal, Anita Pal, Madhumangal Pal · 2007
The notion of centre of a graph is motivated by a large class of problems specially facilitylocationproblemsonanetwork. Inthispaper,analgorithmispresentedtoflndcentres anddiameterofacircular-arcgraph. Ifthecirculararcrepresentationisgiventhentheproposed algorithm runs in O(n) time.