scientific article; zbMATH DE number 2080269

MaRDI QIDQ4472520zbMATH OpenFDO

Authors Biing-Feng Wang, Jyh-Jye Lin

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1969/19690467.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Finding a 2-core of a tree in linear time
• A Linear Time Algorithm for Finding ak-Tree Core
• Finding the two-core of a tree
• Efficient Algorithms for Finding a Core of a Tree with a Specified Length
• On finding the core of a tree with a specified length
• Finding the \(\ell\)-core of a tree
• Linear-time algorithms for tree root problems
• Linear-Time Algorithms for Tree Root Problems
• Algorithms for a Core and k-Tree Core of a Tree
• Distinguishing trees in linear time

Cited in

(9)

• Finding the two-core of a tree
• Finding the \(\ell\)-core of a tree
• Finding a core of a tree with pos/neg weight
• Reliability problems in multiple path-shaped facility location on networks
• Finding a 2-core of a tree in linear time
• On the finding 2-(k,l)-core of a tree with arbitrary real weight
• A Linear Time Algorithm for Finding ak-Tree Core
• Efficient algorithms for a constrained k-tree core problem in a tree network
• Find subtrees of specified weight and cycles of specified length in linear time

This page was built for publication:

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