Pages that link to "Item:Q1606995"
From MaRDI portal
The following pages link to A linear-time algorithm for solving the center problem on weighted cactus graphs (Q1606995):
Displaying 14 items.
- The connected \(p\)-center problem on block graphs with forbidden vertices (Q418726) (← links)
- Backup 2-center on interval graphs (Q442280) (← links)
- Eccentricity function in distance-hereditary graphs (Q784475) (← links)
- The 2-radius and 2-radiian problems on trees (Q955029) (← links)
- The obnoxious center problem on weighted cactus graphs. (Q1427192) (← links)
- An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs (Q1577108) (← links)
- Center problems with pos/neg weights on trees (Q1869485) (← links)
- A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs (Q2079283) (← links)
- Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\) (Q2115870) (← links)
- Efficient algorithms for center problems in cactus networks (Q2371802) (← links)
- (Q3197864) (← links)
- The backup 2‐center and backup 2‐median problems on trees (Q5191127) (← links)
- Computation of diameter, radius and center of permutation graphs (Q6115743) (← links)
- A linear-time algorithm for the center problem in weighted cycle graphs (Q6551721) (← links)