Partitioning trees: Matching, domination, and maximum diameter

DOI10.1007/BF00978378MaRDI QIDQ3916030zbMATH OpenOpenAlexFDO

Authors Arthur M. Farley, Stephen T. Hedetniemi, Andrzej Proskurowski

Publication date 1981

Published in International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00978378

zbMATH Keywords

efficient algorithm

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• b-Matchings in Trees
• A linear algorithm for the domination number of a tree
• A Linear Tree Partitioning Algorithm
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Two-Commodity Flow

Cited in

(10)

• Combinatorial analysis (nonnegative matrices, algorithmic problems)
• Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms
• On some optimization problems on \(k\)-trees and partial \(k\)-trees
• Exact algorithms for the minimum \(s\)-club partitioning problem
• An approximation algorithm for clustering graphs with dominating diametral path
• A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees
• Broadcasting in Trees with Multiple Originators
• Graph theory (algorithmic, algebraic, and metric problems)
• On the hardness of problems around s-clubs on split graphs
• Bibliography on domination in graphs and some basic definitions of domination parameters

This page was built for publication: Partitioning trees: Matching, domination, and maximum diameter

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