Centdian computation in cactus graphs

DOI10.7155/JGAA.00255MaRDI QIDQ3143737zbMATH OpenOpenAlexFDO

Authors Boaz Ben-Moshe, Amit Dvir, Michael Segal, Arie Tamir

Publication date 4 December 2012

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00255

zbMATH Keywords

cactus network

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Centdian Computation for Sensor Networks
• Efficient algorithms for center problems in cactus networks
• A combinatorial algorithm for the ordered 1-median problem on cactus graphs
• The 2-maxian problem on cactus graphs
• Median problems on wheels and cactus graphs

Cited in

(11)

• Intersections and circuits in sets of line segments
• A combinatorial algorithm for the ordered 1-median problem on cactus graphs
• Spanning cactus: complexity and extensions
• Weighted restrained domination in subclasses of planar graphs
• The complexity of counting homomorphisms to cactus graphs modulo 2
• Reconstructing cactus graphs from shortest path information (extended abstract)
• Centdian Computation for Sensor Networks
• Broadcasting on cactus graphs
• Approximability results for the $p$-centdian and the converse centdian problems
• On the complexity of telephone broadcasting from cacti to bounded pathwidth graphs
• A note on locating a central vertex of a 3-cactus graph

This page was built for publication: Centdian computation in cactus graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3143737)