Linear algorithms for edge-vertex domination in trees

MaRDI QIDQ5443202zbMATH OpenFDO

Authors Alan C. Jamieson

Publication date 20 February 2008

zbMATH Keywords

treeedge-vertex dominationlinear algorithmEV-domination set

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• scientific article; zbMATH DE number 3918387
• Results on vertex-edge and independent vertex-edge domination
• Edge-vertex domination in trees
• scientific article; zbMATH DE number 30748
• Linear time algorithms for generalized edge dominating set problems

Cited in

(6)

• scientific article; zbMATH DE number 30748 (Why is no real title available?)
• Edge-vertex domination of acyclic trapezoid graphs: algorithm and complexity
• A linear time algorithm for optimal \(k\)-hop dominating set of a tree
• Perfect edge domination and efficient edge domination in graphs
• Some graph classes and the Wimer edge variant
• A linear‐time algorithm for broadcast domination in a tree

This page was built for publication: Linear algorithms for edge-vertex domination in trees

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