Efficient sets in graphs

DOI10.1016/0166-218X(93)90225-DMaRDI QIDQ686251zbMATH OpenFDO

Authors Juan-Miguel Gracia

Publication date 31 January 1994

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

efficiency of a graphindependent efficient dominating set

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Efficient sets in partial k-trees
• scientific article; zbMATH DE number 637310
• scientific article; zbMATH DE number 4085682
• scientific article; zbMATH DE number 5080622
• The efficiency of AC graphs

Cites work

• scientific article; zbMATH DE number 3859049 (Why is no real title available?)
• scientific article; zbMATH DE number 3869363 (Why is no real title available?)
• scientific article; zbMATH DE number 4085682 (Why is no real title available?)
• scientific article; zbMATH DE number 4095510 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 933213 (Why is no real title available?)
• A recurrence template for several parameters in series-parallel graphs
• Linear-time computation of optimal subgraphs of decomposable graphs
• Planar 3DM is NP-complete

Cited in

(8)

• The efficiency of AC graphs
• Self-stabilizing algorithms for efficient sets of graphs and trees
• Efficiency of star-like graphs and the Atlanta subway network
• A Taxonomy of Perfect Domination
• Efficient sets in partial \(k\)-trees
• Global efficiency of graphs
• A self-stabilizing algorithm for optimally efficient sets in graphs
• A survey on the Intersection graphs of ideals of rings

This page was built for publication: Efficient sets in graphs

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