Pages that link to "Item:Q2371802"

The following pages link to Efficient algorithms for center problems in cactus networks (Q2371802):

Displaying 21 items.

• The connected \(p\)-center problem on block graphs with forbidden vertices (Q418726) (← links)
• Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks (Q496433) (← links)
• An optimal algorithm for the weighted backup 2-center problem on a tree (Q513273) (← links)
• A linear-time algorithm for solving the center problem on weighted cactus graphs (Q1606995) (← links)
• The connected \(p\)-center problem on cactus graphs (Q1630992) (← links)
• Algorithm to find a maximum 2-packing set in a cactus (Q1748991) (← links)
• The weighted \(k\)-center problem in trees for fixed \(k\) (Q2077394) (← links)
• A combinatorial algorithm for the ordered 1-median problem on cactus graphs (Q2329555) (← links)
• Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs (Q2347002) (← links)
• Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks (Q2827807) (← links)
• The complexity of counting homomorphisms to cactus graphs modulo 2 (Q2828223) (← links)
• Optimal Data Structures for Farthest-Point Queries in Cactus Networks (Q2940594) (← links)
• Centdian Computation in Cactus Graphs (Q3143737) (← links)
• (Q3197864) (← links)
• A polynomial time algorithm for finding the absolute center of a network (Q4000529) (← links)
• Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
• (Q5091199) (← links)
• Exploiting Structure: Location Problems on Trees and Treelike Graphs (Q5506729) (← links)
• Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (Q5858646) (← links)
• A linear-time algorithm for the center problem in weighted cycle graphs (Q6551721) (← links)
• The two-center problem of uncertain points on trees (Q6606211) (← links)