Efficient Algorithms for Subgraph Listing

Author： Zechner Niklas   Lingas Andrzej  

Publisher： MDPI

E-ISSN： 1999-4893|7|2|243-252

ISSN： 1999-4893

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

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 the Maximum Sum Problems

By Bae Sung Eun   Shinn Tong-Wook   Takaoka Tadao  

Algorithms, Vol. 10, Iss. 1, 2017-01 ,pp. : 5-5

MDPI

Access to resources Recommend Favorite

Probabilistic Distributed Algorithms for Energy Efficient Routing and Tracking in Wireless Sensor Networks

By Nikoletseas Sotiris   Spirakis Paul G.  

Algorithms, Vol. 2, Iss. 1, 2009-02 ,pp. : 121-157

MDPI

Access to resources Recommend Favorite

The Parameterized Complexity of the Rainbow Subgraph Problem†

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

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

MDPI

Access to resources Recommend Favorite

Multicarrier Spread Spectrum Modulation Schemes and Efficient FFT Algorithms for Cognitive Radio Systems

By Sundararajan Mohandass   Govindaswamy Umamaheswari  

Electronics, Vol. 3, Iss. 3, 2014-07 ,pp. : 419-443

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