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

Author： Akutsu Tatsuya Tamura Takeyuki

Publisher： MDPI

E-ISSN： 1999-4893|6|1|119-135

ISSN： 1999-4893

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

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

Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability

By Bonizzoni Paola Dondi Riccardo Pirola Yuri

Algorithms, Vol. 6, Iss. 1, 2012-12 ,pp. : 1-11

MDPI

Access to resources Recommend Favorite

Linear Time Local Approximation Algorithm for Maximum Stable Marriage

By Király Zoltán

Algorithms, Vol. 6, Iss. 3, 2013-08 ,pp. : 471-484

MDPI

Access to resources Recommend Favorite

An Effective and Efficient MapReduce Algorithm for Computing BFS-Based Traversals of Large-Scale RDF Graphs

By Cuzzocrea Alfredo Cosulschi Mirel de Virgilio Roberto

Algorithms, Vol. 9, Iss. 1, 2016-01 ,pp. : 7-7

MDPI

Access to resources Recommend Favorite

Computing the Eccentricity Distribution of Large Graphs

By Takes Frank W. Kosters Walter A.

Algorithms, Vol. 6, Iss. 1, 2013-02 ,pp. : 100-118

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