scientific article
From MaRDI portal
Publication:3785978
zbMath0643.68093MaRDI QIDQ3785978
T. V. Wimer, E. Hare, Stephen T. Hedetniemi, Ken Peters, Renu C. Laskar
Publication date: 1987
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)
Related Items
Perfect edge domination and efficient edge domination in graphs, A recurrence template for several parameters in series-parallel graphs, Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs, THE MINIMAL DOMINATING SETS IN A DIRECTED GRAPH AND THE KEY INDICATORS SET OF SOCIO–ECONOMIC SYSTEM, On (r,s)-Fuzzy Domination in Fuzzy Graphs, The many facets of upper domination, On bondage numbers of graphs: a survey with some comments, Algorithms for recognition of regular properties and decomposition of recursive graph families, Cross-series-parallel digraphs, Upper domination: towards a dichotomy through boundary properties, Counting dominating sets in generalized series-parallel graphs, Distance Domination in Graphs, Fractional Dominating Parameters, A Boundary Property for Upper Domination, Upper Domination: Complexity and Approximation, Fractional domination game, Nearly perfect sets in graphs, Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph, A linear-time certifying algorithm for recognizing generalized series-parallel graphs, Bibliography on domination in graphs and some basic definitions of domination parameters
