This paper focuses on the centdian problem in a cactus network where a cactus network is a connected undirected graph, and any two simple cycles in the graph have at most one node in common. The cactus network has important applications for wireless sensor networks when a tree topology might not be applicable and for extensions to the ring architecture. The centdian criterion represents a convex combination of two QoS requirements: transport and delay. To the best of our knowledge, no efficient algorithm has yet been developed for constructing a centdian node in a cactus graph, either sequential or distributed. We first investigate the properties of the centdian node in a cycle graph, and then explore the behavior of the centdian node in a cactus graph. Finally, we present new efficient sequential and distributed algorithms for finding all centdian nodes in a cycle graph and a cactus graph.

Original languageEnglish
Pages (from-to)199-224
Number of pages26
JournalJournal of Graph Algorithms and Applications
Issue number2
StatePublished - 1 Jan 2012

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Geometry and Topology
  • Computer Science(all)
  • Computer Science Applications
  • Computational Theory and Mathematics


Dive into the research topics of 'Centdian computation in cactus graphs'. Together they form a unique fingerprint.

Cite this