scientific article; zbMATH DE number 2166874

MaRDI QIDQ4674155zbMATH OpenFDO

Authors Blaž Zmazek, Janez Žerovnik

Publication date 9 May 2005

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Algorithms and Computation
• The obnoxious center problem on weighted cactus graphs.
• Efficient algorithms for center problems in cactus networks
• A linear-time algorithm for solving the center problem on weighted cactus graphs
• scientific article; zbMATH DE number 1786156

Cited in

(7)

• A linear-time algorithm for solving the center problem on weighted cactus graphs
• A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs
• Volume computation for sparse Boolean quadric relaxations
• Efficient algorithms for center problems in cactus networks
• Optimal Data Structures for Farthest-Point Queries in Cactus Networks
• A linear time algorithm for computing longest paths in cactus graphs
• Algorithms and Computation

This page was built for publication:

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