Corpus ID: 237532572

Finding Efficient Domination for $(P_9,S_{1,2,5},S_{3,3,3}$-Free Chordal Bipartite Graphs in Polynomial Time

@inproceedings{Brandstadt2021FindingED,
  title={Finding Efficient Domination for \$(P\_9,S\_\{1,2,5\},S\_\{3,3,3\}\$-Free Chordal Bipartite Graphs in Polynomial Time},
  author={Andreas Brandstadt and Raffaele Mosca},
  year={2021}
}
A vertex set D in a finite undirected graph G is an efficient dominating set (e.d.s. for short) of G if every vertex of G is dominated by exactly one vertex of D. The Efficient Domination (ED) problem, which asks for the existence of an e.d.s. in G, is known to be NP-complete for P7-free graphs, and even for very restricted H-free bipartite graph classes such as for K1,4-free bipartite graphs as well as for C4-free bipartite graphs while it is solvable in polynomial time for P8-free bipartite… Expand

References

SHOWING 1-10 OF 22 REFERENCES
Weighted efficient domination problem on some perfect graphs
  • C. Lu, C. Tang
  • Computer Science, Mathematics
  • Discret. Appl. Math.
  • 2002
TLDR
This paper gives O (| V |) time algorithms for the weighted efficient domination problem on bipartite permutation graphs and distance-hereditary graphs. Expand
Finding Efficient Domination for P8-Free Bipartite Graphs in Polynomial Time
TLDR
The Efficient Domination problem, which asks for the existence of an e.d.s. in G, is known to be NP-complete for P7-free graphs, and even for very restricted H-free bipartite graph classes. Expand
Finding Efficient Domination for S1, 3, 3-Free Bipartite Graphs in Polynomial Time
TLDR
This paper shows that ED can be solved in polynomial time for $S_{1,3,3}$-free bipartite graphs and for $C_4$- free bipartsite graphs. Expand
On Efficient Domination for Some Classes of H-Free Bipartite Graphs
TLDR
It is shown that (weighted) ED can be solved in polynomial time for H-free bipartite graphs when $H$ is $P_7$ or $\ell P_4$ for fixed $\ell$, and that ED is \NP-complete for bipartITE graphs with diameter at most 6. Expand
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
TLDR
It is shown that ED remains NP-complete on alpha-acyclic hypergraphs, and is solvable in polynomial time on hypertrees, while EED isPolynomial onalpha-ACYclichypergraphs and NP- complete on hypertree. Expand
Weighted Efficient Domination for P5-Free and P6-Free Graphs
TLDR
By a direct approach which is simpler and faster, a time solution is found for weighted ED on the Maximum Weight Independent Set problem for $P_6$-free graphs, and it is shown that weighted ED is solvable in linear time for the P_5- free graphs. Expand
Milanič, Polynomial-time algorithms for Weighted Efficient Domination problems in AT-free graphs and dually chordal graphs, Information
  • Processing Letters
  • 2015
Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
TLDR
A framework for solving the minimum weighted efficient domination (Min-WED) problem is developed based on a reduction to the maximum weight independent set problem in the square of the input graph. Expand
Algorithms for unipolar and generalized split graphs
TLDR
This paper presents a recognition algorithm for unipolar graphs that utilizes a minimal triangulation of the given graph, and produces a partition when one exists, and reports that the perfect code problem is NP-complete for chordal un bipolar graphs. Expand
Efficient domination and polarity
TLDR
This thesis introduces a framework for the authors' NP-completeness proofs and uses it to sharpen known results for all mentioned problems, and reveals new tractable cases of Efficient Domination, Polarity, and Monopolarity. Expand
...
1
2
3
...