Pages that link to "Item:Q4339005"
From MaRDI portal
The following pages link to A Linear Time Algorithm for Finding ak-Tree Core (Q4339005):
Displaying 11 items.
- Distributed algorithms for finding and maintaining a \(k\)-tree core in a dynamic network (Q1029012) (← links)
- Finding the \(\ell\)-core of a tree (Q1348250) (← links)
- Extensive facility location problems on networks: an updated review (Q1667394) (← links)
- On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges (Q2294142) (← links)
- A linear time algorithm for balance vertices on trees (Q2419583) (← links)
- Finding a 2-core of a tree in linear time (Q2784511) (← 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)
- A simple solution to the <i>k</i>‐core problem (Q3419611) (← links)
- (Q4472520) (← links)
- A linear algorithm for finding the <i>k</i>‐broadcast center of a tree (Q5191149) (← links)