The Parameterized Complexity of the Rainbow Subgraph Problem†

Author： Hüffner Falk   Komusiewicz Christian   Niedermeier Rolf   Rötzschke Martin  

Publisher： MDPI

E-ISSN： 1999-4893|8|1|60-81

ISSN： 1999-4893

Source： Algorithms, Vol.8, Iss.1, 2015-02, pp. : 60-81

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Efficient Algorithms for Subgraph Listing

By Zechner Niklas   Lingas Andrzej  

Algorithms, Vol. 7, Iss. 2, 2014-05 ,pp. : 243-252

MDPI

Access to resources Recommend Favorite

A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree

By Akutsu Tatsuya   Tamura Takeyuki  

Algorithms, Vol. 6, Iss. 1, 2013-02 ,pp. : 119-135

MDPI

Access to resources Recommend Favorite

Inapproximability of Maximum Biclique Problems, Minimum k-Cut and Densest At-Least-k-Subgraph from the Small Set Expansion Hypothesis †

By Manurangsi Pasin  

Algorithms, Vol. 11, Iss. 1, 2018-01 ,pp. : 10-10

MDPI

Access to resources Recommend Favorite

Approach of Complexity in Nature: Entropic Nonuniqueness

By Tsallis Constantino  

Axioms, Vol. 5, Iss. 3, 2016-08 ,pp. : 20-20

MDPI

Access to resources Recommend Favorite

The Elder Problem

By Elder John W.   Simmons Craig T.   Diersch Hans-Jörg   Frolkovič Peter   Holzbecher Ekkehard   Johannsen Klaus  

Fluids, Vol. 2, Iss. 1, 2017-03 ,pp. : 11-11

MDPI

Access to resources Recommend Favorite