scientific article; zbMATH DE number 4121429
From MaRDI portal
Publication:4734763
zbMath0684.68052MaRDI QIDQ4734763
Michael S. Jacobson, Ken Peters
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Complexity of computation (including implicit computational complexity) (03D15) Graph theory (05C99)
Related Items (17)
Algorithmic Aspects of Disjunctive Domination in Graphs ⋮ Heuristics for \(k\)-domination models of facility location problems in street networks ⋮ On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence ⋮ The 2-domination number of cylindrical graphs ⋮ Complete characterizations of the 2-domination and \(\mathcal{P}_3\)-hull number polytopes ⋮ Domination and convexity problems in the target set selection model ⋮ Algorithmic aspects of the \(k\)-domination problem in graphs ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs ⋮ The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination ⋮ Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs ⋮ Multiple Domination ⋮ MAX for \(k\)-independence in multigraphs ⋮ New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs ⋮ On the \(k\)-domination number of digraphs ⋮ A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters
This page was built for publication:
