Pages that link to "Item:Q3902510"
From MaRDI portal
The following pages link to A linear algorithm for a core of a tree (Q3902510):
Displaying 40 items.
- Proximity and average eccentricity of a graph (Q436337) (← links)
- Open neighborhood locating-dominating in trees (Q628345) (← links)
- The path-variance problem on tree networks (Q705500) (← links)
- Algorithms for central-median paths with bounded length on trees (Q864041) (← links)
- Two paths location of a tree with positive or negative weights (Q896109) (← links)
- Finding the conditional location of a median path on a tree (Q937298) (← links)
- Finding the two-core of a tree (Q1086244) (← links)
- A review of extensive facility location in networks (Q1278421) (← links)
- Partial and perfect path covers of cographs (Q1281391) (← links)
- Location of paths on trees with minimal eccentricity and superior section (Q1284599) (← links)
- A unifying location model on tree graphs based on submodularity property (Q1314341) (← links)
- Parallel algorithm for finding a core of a tree network (Q1336753) (← links)
- Finding the \(\ell\)-core of a tree (Q1348250) (← links)
- Parity dimension for graphs (Q1584295) (← links)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
- Extensive facility location problems on networks: an updated review (Q1667394) (← links)
- An improved algorithm for the minmax regret path centdian problem on trees (Q1672003) (← links)
- Finding an optimal core on a tree network with M/G/c/c state-dependent queues (Q1731597) (← links)
- Locating tree-shaped facilities using the ordered median objective (Q1771313) (← links)
- A linear algorithm for the number of degree constrained subforests of a tree (Q1836478) (← links)
- Finding a core of a tree with pos/neg weight (Q1935945) (← links)
- Efficient algorithms for the minmax regret path center problem with length constraint on trees (Q2136270) (← links)
- An improved algorithm for the minmax regret path center problem on trees (Q2194857) (← 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)
- Reliability problems in multiple path-shaped facility location on networks (Q2339811) (← links)
- On the minmax regret path median problem on trees (Q2353396) (← links)
- The location of median paths on grid graphs (Q2480201) (← links)
- A branch-and-cut algorithm for the median-path problem (Q2490367) (← links)
- Two Paths Location of a Tree with Positive or Negative Weights (Q2942409) (← 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)
- INDUCTIVE ALGORITHMS ON FINITE TREES (Q3490010) (← links)
- Core and Conditional Core Path of Specified Length in Special Classes of Graphs (Q3605503) (← links)
- Finding cores of limited length (Q5096925) (← links)
- The continuous and discrete path‐variance problems on trees (Q5191143) (← links)
- On fixed-parameter solvability of the minimax path location problem (Q6063573) (← links)
- The extensive 1-median problem with radius on networks (Q6091088) (← links)
