Finding a 2-core of a tree in linear time

DOI10.1137/S0895480100374242MaRDI QIDQ2784511zbMATH OpenFDO

Authors Biing-Feng Wang

Publication date 23 April 2002

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0895480100374242

zbMATH Keywords

algorithmscoresgraphsnetwork location theoryparallel algorithmstrees

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 2080269
• Finding the two-core of a tree
• Finding the \(\ell\)-core of a tree
• A Linear Time Algorithm for Finding ak-Tree Core
• A simple optimal parallel algorithm for a core of a tree

Cited in

(14)

• Finding the two-core of a tree
• Parallel algorithm for finding a core of a tree network
• Finding the \(\ell\)-core of a tree
• Extensive facility location problems on networks: an updated review
• Locating tree-shaped facilities using the ordered median objective
• On the location of a constrained k-tree facility in a tree network with unreliable edges
• Reliability problems in multiple path-shaped facility location on networks
• Two paths location of a tree with positive or negative weights
• On the finding 2-(k,l)-core of a tree with arbitrary real weight
• A Linear Time Algorithm for Finding ak-Tree Core
• scientific article; zbMATH DE number 2080269 (Why is no real title available?)
• Comments on: ``Extensive facility location problems on networks: an updated review
• Two paths location of a tree with positive or negative weights
• Finding the conditional location of a median path on a tree

This page was built for publication: Finding a 2-core of a tree in linear time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784511)