Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Dominating Induced Matchings for $P_8$-free Graphs in Polynomial Time (1507.06541v2)

Published 23 Jul 2015 in cs.DM

Abstract: Let $G=(V,E)$ be a finite undirected graph. An edge set $E' \subseteq E$ is a dominating induced matching (d.i.m.) in $G$ if every edge in $E$ is intersected by exactly one edge of $E'$. The Dominating Induced Matching (DIM) problem asks for the existence of a d.i.m. in $G$; this problem is also known as the Efficient Edge Domination problem. The DIM problem is related to parallel resource allocation problems, encoding theory and network routing. It is NP-complete even for very restricted graph classes such as planar bipartite graphs with maximum degree three and is solvable in linear time for $P_7$-free graphs. However, its complexity was open for $P_k$-free graphs for any $k \ge 8$; $P_k$ denotes the chordless path with $k$ vertices and $k-1$ edges. We show in this paper that the weighted DIM problem is solvable in polynomial time for $P_8$-free graphs.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Raffaele Mosca (22 papers)
  2. Andreas Brandstadt (9 papers)

Summary

We haven't generated a summary for this paper yet.