scientific article; zbMATH DE number 3959487

MaRDI QIDQ3728039zbMATH OpenFDO

Authors Eugene L. Lawler, Peter Slater

Publication date 1985

zbMATH Keywords

dominationliner-time algorithm

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 30748
• A linear algorithm for \(\langle r, s \rangle\)-domination of a tree
• A linear time algorithm for optimal \(k\)-hop dominating set of a tree
• A linear‐time algorithm for broadcast domination in a tree
• scientific article; zbMATH DE number 3918387

Cited in

(11)

• Bibliography on domination in graphs and some basic definitions of domination parameters
• An Analysis of a Good Algorithm for the Subtree Problem, Corrected
• Find subtrees of specified weight and cycles of specified length in linear time
• Linear-time computation of optimal subgraphs of decomposable graphs
• Models for minimum cost dominating trees
• A linear time algorithm for optimal \(k\)-hop dominating set of a tree
• An improved algorithm for finding a length-constrained maximum-density subtree in a tree
• A generalized linear time algorithm for an optimal \(k\)-distance dominating set of a weighted tree
• A linear algorithm for \(\langle r, s \rangle\)-domination of a tree
• A linear time and space algorithm for finding isomorphic subtrees of a binary tree
• On minimum dominating sets with minimum intersection

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 Q3728039)