The following pages link to Finding the two-core of a tree (Q1086244):
Displaying 15 items.
- Two paths location of a tree with positive or negative weights (Q896109) (← links)
- Efficient algorithms for two generalized 2-median problems and the group median problem on trees (Q1006061) (← links)
- Distributed algorithms for finding and maintaining a \(k\)-tree core in a dynamic network (Q1029012) (← links)
- A review of extensive facility location in networks (Q1278421) (← links)
- Partial and perfect path covers of cographs (Q1281391) (← links)
- Finding the \(\ell\)-core of a tree (Q1348250) (← links)
- Extensive facility location problems on networks: an updated review (Q1667394) (← links)
- Locating tree-shaped facilities using the ordered median objective (Q1771313) (← links)
- Finding a core of a tree with pos/neg weight (Q1935945) (← links)
- Finding a 2-core of a tree in linear time (Q2784511) (← links)
- Two Paths Location of a Tree with Positive or Negative Weights (Q2942409) (← links)
- Minimax regret path location on trees (Q3100694) (← links)
- Algorithms for a Core and k-Tree Core of a Tree (Q3141526) (← links)
- INDUCTIVE ALGORITHMS ON FINITE TREES (Q3490010) (← links)
- (Q4472520) (← links)
