Pages that link to "Item:Q1427192"
From MaRDI portal
The following pages link to The obnoxious center problem on weighted cactus graphs. (Q1427192):
Displaying 19 items.
- Backup 2-center on interval graphs (Q442280) (← links)
- Broadcasting on cactus graphs (Q512890) (← links)
- On the remoteness function in median graphs (Q967439) (← links)
- Chain hexagonal cacti: matchings and independent sets (Q973140) (← links)
- A linear-time algorithm for solving the center problem on weighted cactus graphs (Q1606995) (← links)
- Algorithm to find a maximum 2-packing set in a cactus (Q1748991) (← links)
- A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs (Q2079283) (← links)
- Zeroth-order general Randić index of cactus graphs (Q2293835) (← links)
- Efficient algorithms for center problems in cactus networks (Q2371802) (← links)
- Computing median and antimedian sets in median graphs (Q2379917) (← links)
- Review of obnoxious facilities location problems (Q2669654) (← links)
- The obnoxious center problem on a tree (Q2753540) (← links)
- On a conjecture for the signless Laplacian spectral radius of cacti with given matching number (Q2961481) (← links)
- Obnoxious Centers in Graphs (Q3013158) (← links)
- The Hosoya polynomial of double weighted graphs (Q4629558) (← links)
- A Self-Stabilizing Algorithm for a Maximal 2-Packing in a Cactus Graph Under Any Scheduler (Q4639900) (← links)
- Exploiting Structure: Location Problems on Trees and Treelike Graphs (Q5506729) (← links)
- Counting independent dominating sets in linear polymers (Q6101413) (← links)
- Obnoxious facility location in multiple dimensional space (Q6113555) (← links)