A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree
The maximum common connected edge subgraph problem is to find a connected graph with the maximum number of edges that is isomorphic to a subgraph of each of the two input graphs, where it has applications in pattern recognition and chemistry. This paper presents a dynamic programming algorithm for t...
Sparad:
| Huvudupphov: | , |
|---|---|
| Materialtyp: | Artigo |
| Språk: | Inglês |
| Utgiven: |
MDPI AG
2013-02-01
|
| Serie: | Algorithms |
| Ämnen: | |
| Länkar: | http://www.mdpi.com/1999-4893/6/1/119 |
| Taggar: |
Inga taggar, Lägg till första taggen!
|