Efficient sets in graphs

DOI10.1016/0166-218X(93)90225-DzbMath0780.68097MaRDI QIDQ686251

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)

Related Items (6)

A Taxonomy of Perfect Domination ⋮ A self-stabilizing algorithm for optimally efficient sets in graphs ⋮ Self-stabilizing algorithms for efficient sets of graphs and trees ⋮ A survey on the Intersection graphs of ideals of rings ⋮ Efficient sets in partial \(k\)-trees ⋮ The efficiency of AC graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A recurrence template for several parameters in series-parallel graphs
• Planar 3DM is NP-complete
• Linear-time computation of optimal subgraphs of decomposable graphs

This page was built for publication: Efficient sets in graphs