Finding Efficient Domination for P_8-Free Bipartite Graphs in Polynomial Time

01/05/2021
by   Andreas Brandstädt, et al.
0

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 -complete for P_7-free graphs, and even for very restricted H-free bipartite graph classes such as for K_1,4-free bipartite graphs as well as for C_4-free bipartite graphs while it is solvable in polynomial time for P_7-free bipartite graphs as well as for S_2,2,4-free bipartite graphs. Here we show that ED can be solved in polynomial time for P_8-free bipartite graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/15/2021

Finding Efficient Domination for (S_1,2,5,S_3,3,3-Free Chordal Bipartite Graphs in Polynomial Time

A vertex set D in a finite undirected graph G is an efficient dominating...
research
03/01/2023

Scarf's algorithm and stable marriages

Scarf's algorithm gives a pivoting procedure to find a special vertex – ...
research
09/24/2022

Compressing bipartite graphs with a dual reordering scheme

In order to manage massive graphs in practice, it is often necessary to ...
research
10/29/2020

Finding Efficient Domination for S_1,1,5-Free Bipartite Graphs in Polynomial Time

A vertex set D in a finite undirected graph G is an efficient dominating...
research
08/02/2019

Finding Dominating Induced Matchings in P_9-Free Graphs in Polynomial Time

Let G=(V,E) be a finite undirected graph. An edge set E' ⊆ E is a domin...
research
09/08/2019

Counting weighted independent sets beyond the permanent

In a landmark paper, Jerrum, Sinclair and Vigoda (2004) showed that the ...
research
07/04/2022

Optimal Vertex-Cut Sparsification of Quasi-Bipartite Graphs

In vertex-cut sparsification, given a graph G=(V,E) with a terminal set ...

Please sign up or login with your details

Forgot password? Click here to reset