Pages that link to "Item:Q3141526"
From MaRDI portal
The following pages link to Algorithms for a Core and k-Tree Core of a Tree (Q3141526):
Displaying 21 items.
- The path-variance problem on tree networks (Q705500) (← links)
- Distributed algorithms for finding and maintaining a \(k\)-tree core in a dynamic network (Q1029012) (← links)
- Finding the two-core of a tree (Q1086244) (← links)
- A review of extensive facility location in networks (Q1278421) (← links)
- Optimal allocation for partially replicated database systems on tree- based networks (Q1346862) (← links)
- Finding the \(\ell\)-core of a tree (Q1348250) (← links)
- The centdian subtree on tree networks (Q1602695) (← links)
- Extensive facility location problems on networks: an updated review (Q1667394) (← links)
- Locating tree-shaped facilities using the ordered median objective (Q1771313) (← links)
- Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem (Q2217463) (← links)
- On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges (Q2294142) (← links)
- Efficient algorithms to solve the link-orientation problem for multi-square, convex-bipartite, and convex-split networks (Q2568262) (← links)
- An efficient algorithm for finding the semi-obnoxious \((k,l)\)-core of a tree (Q2790841) (← links)
- Locating median paths on connected outerplanar graphs (Q3008924) (← links)
- Minimax regret path location on trees (Q3100694) (← links)
- On the finding 2-(k,l)-core of a tree with arbitrary real weight (Q3389575) (← links)
- A Linear Time Algorithm for Finding ak-Tree Core (Q4339005) (← links)
- (Q4472520) (← links)
- Finding cores of limited length (Q5096925) (← links)
- The continuous and discrete path‐variance problems on trees (Q5191143) (← links)
- (Q5273088) (← links)
