Pages that link to "Item:Q1348250"
From MaRDI portal
The following pages link to Finding the \(\ell\)-core of a tree (Q1348250):
Displaying 17 items.
- Algorithms for central-median paths with bounded length on trees (Q864041) (← links)
- Comparing different metaheuristic approaches for the median path problem with bounded length (Q928015) (← links)
- A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree (Q987822) (← links)
- Extensive facility location problems on networks: an updated review (Q1667394) (← links)
- Finding an optimal core on a tree network with M/G/c/c state-dependent queues (Q1731597) (← links)
- Finding a core of a tree with pos/neg weight (Q1935945) (← 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)
- An algorithm for solving the bi-objective median path-shaped facility on a tree network (Q2305157) (← links)
- The location of median paths on grid graphs (Q2480201) (← links)
- Finding a 2-core of a tree in linear time (Q2784511) (← 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)
- Algorithms for a Core and k-Tree Core of a Tree (Q3141526) (← links)
- On the finding 2-(k,l)-core of a tree with arbitrary real weight (Q3389575) (← links)
- Core and Conditional Core Path of Specified Length in Special Classes of Graphs (Q3605503) (← links)
- (Q4472520) (← links)
