DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Dominating set
Dominating set
Fast Dynamic Programming on Graph Decompositions
Total Domination on Some Graph Operators
Locating Domination in Bipartite Graphs and Their Complements
Dominating Cliques in Graphs
The Bidimensionality Theory and Its Algorithmic
Combinatorial Optimization
Polynomial-Time Data Reduction for Dominating Set∗
Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation
PERFECT DOMINATING SETS Ý Marilynn Livingston£ Quentin F
On Combinatorial Optimization for Dominating Sets (Literature Survey, New Models)
Arxiv:1911.08964V5 [Cs.DS] 26 Apr 2021 Ewe Orsadr Rbes D Problems: Standard Four Between Ta.(09 Hwdta H Rbe Splnma-Iesol Polynomial-Time Respectively
A Gentle Introduction to Computational Complexity Theory, and a Little Bit More
Bidimensionality: New Connections Between FPT Algorithms and Ptass
NP-Completeness and APX-Completeness of Restrained Domination in Graphs
The Dominating Set Problem in Geometric Intersection Graphs∗†
A Note on Bipartite Graphs Whose [1, K]-Domination Number Equal to Their Number of Vertices
Clone Hop Domination Number of Some Total and Line Graphs
Matching Transversal Edge Domination in Graphs
Top View
A Note on Domination in Bipartite Graphs
Complexity and Approximation Ratio of Semitotal Domination in Graphs 1
Exploring Algorithms for Branch Decompositions of Planar Graphs (132 Pp.)
An Integer Linear Programming Formulation for the Convex
Faster Algorithms on Branch and Clique Decompositions
Dominating Set Is NP-Complete. 3-SAT Problem: (X1 Or X1 Or X2) and (¬X1 Or ¬ X2 Or ¬ X2) and (¬X1 Or X2 Or X3) 25
Dominating Set on Bipartite Graphs
Complexity of Domination-Type Problems in Graphs∗
Fixed Parameter Algorithms for Planar Dominating Set and Related Problems∗
Approximation Algorithms for Dominating Set in Disk Graphs*
Independent Domination in Line Graphs
Complexity Results for $ K $-Domination and $\Alpha
The Bidimensionality Theory and Its Algorithmic Applications∗
Bidimensionality and Kernels Name: Daniel Lokshtanov1 Affil./Addr
Online Dominating Set∗
Introduction to Algorithms Part 3: P, NP Hard Problems
Computational Study on a PTAS for Planar Dominating Set Problem
I. Introduction