Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Finding a 2-Core of a Tree in Linear Time

From MaRDI portal
Publication:2784511
Jump to:navigation, search

DOI10.1137/S0895480100374242zbMath0991.05096MaRDI QIDQ2784511

Biing-Feng Wang

Publication date: 23 April 2002

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


zbMATH Keywords

algorithmsgraphsparallel algorithmstreescoresnetwork location theory


Mathematics Subject Classification ID

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


Related Items (8)

Extensive facility location problems on networks: an updated review ⋮ Two Paths Location of a Tree with Positive or Negative Weights ⋮ Two paths location of a tree with positive or negative weights ⋮ Finding the conditional location of a median path on a tree ⋮ 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 ⋮ Comments on: ``Extensive facility location problems on networks: an updated review ⋮ Reliability problems in multiple path-shaped facility location on networks







This page was built for publication: Finding a 2-Core of a Tree in Linear Time

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2784511&oldid=15674758"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 16:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki