Dominating Induced Matchings for P7-Free Graphs in Linear Time

Andreas Brandstädt, Raffaele Mosca

Type: Preprint

Publication Date: 2011-06-14

Citations: 9

Locations

arXiv (Cornell University) - View

Similar Works

Action	Title	Year	Authors
+	Dominating Induced Matchings for P7-Free Graphs in Linear Time	2011	Andreas Brandstädt Raffaele Mosca
+	Dominating Induced Matchings for $P_8$-free Graphs in Polynomial Time	2015	Andreas Brandstädt Raffaele Mosca
+	Dominating Induced Matchings for $P_8$-free Graphs in Polynomial Time	2015	Andreas Brandstädt Raffaele Mosca
+	Finding Dominating Induced Matchings in $P_9$-Free Graphs in Polynomial Time	2019	Andreas Brandstädt Raffaele Mosca
+ PDF Chat	Dominating Induced Matchings for P 7-Free Graphs in Linear Time	2012	Andreas Brandstädt Raffaele Mosca
+ PDF Chat	Dominating Induced Matchings for P 7-free Graphs in Linear Time	2011	Andreas Brandstädt Raffaele Mosca
+	Finding Dominating Induced Matchings in $(S_{2,2,3})$-Free Graphs in Polynomial Time	2017	Andreas Brandstädt Raffaele Mosca
+	Finding Dominating Induced Matchings in $(S_{2,2,3})$-Free Graphs in Polynomial Time	2017	Andreas Brandstädt Raffaele Mosca
+	Dominating Induced Matchings in $S_{1,2,4}$-Free Graphs	2017	Andreas Brandstädt Raffaele Mosca
+	Dominating Induced Matchings in $S_{1, 2, 4}$-Free Graphs.	2017	Andreas Brandstädt Raffaele Mosca
+	Finding Dominating Induced Matchings in $S_{1,1,5}$-Free Graphs in Polynomial Time	2019	Andreas Brandstädt Raffaele Mosca
+	Finding Dominating Induced Matchings in $S_{1,1,5}$-Free Graphs in Polynomial Time	2019	Andreas Brandstädt Raffaele Mosca
+ PDF Chat	Finding Dominating Induced Matchings in $P_{10}$-Free Graphs in Polynomial Time	2022	Raffaele Mosca Andreas Brandstädt
+	Finding dominating induced matchings in P10-free graphs in polynomial time	2024	Andreas Brandstädt Raffaele Mosca
+	An $O^*(1.1939^n)$ time algorithm for minimum weighted dominating induced matching	2013	Min Chih Lin Michel J. Mizrahi Jayme L. Szwarcfiter
+	An $O^*(1.1939^n)$ time algorithm for minimum weighted dominating induced matching	2013	Min Chih Lin Michel J. Mizrahi Jayme L. Szwarcfiter
+	Weighted Efficient Domination for $(P_5+kP_2)$-Free Graphs in Polynomial Time	2014	Andreas Brandstädt Vassilis Giakoumakis
+	Weighted Connected Matchings	2022	Guilherme C. M. Gomes Bruno P. Masquio Paulo E. D. Pinto Vinícius F. dos Santos Jayme L. Szwarcfiter
+	Efficient Domination for Some Subclasses of $P_6$-Free Graphs in Polynomial Time	2015	Andreas Brandstädt Elaine M. Eschen Erik Friese
+	Efficient Domination for Some Subclasses of $P_6$-Free Graphs in Polynomial Time	2015	Andreas Brandstädt Elaine M. Eschen Erik Friese

Works That Cite This (4)

Action	Title	Year	Authors
+ PDF Chat	Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs	2012	Andreas Brandstädt Arne Leitert Dieter Rautenbach
+ PDF Chat	An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching	2013	Min Chih Lin Michel J. Mizrahi Jayme L. Szwarcfiter
+ PDF Chat	Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs	2014	Andreas Brandstädt Ragnar Nevries
+ PDF Chat	New Polynomial Cases of the Weighted Efficient Domination Problem	2013	Andreas Brandstädt Martin Milanič Ragnar Nevries

Works Cited by This (1)

Action	Title	Year	Authors
+	On the structure of (<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si6.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>,gem)-free graphs	2004	Andreas Brandstädt Dieter Kratsch