"A Polynomial-Time Algorithm for Computing the Maximum Common Connected ..."

Tatsuya Akutsu, Takeyuki Tamura (2013)

> Home

Details and statistics

DOI: 10.3390/A6010119

access: open

type: Journal Article

metadata version: 2023-08-28

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/algorithms/AkutsuT13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithms/AkutsuT13
Tatsuya Akutsu, Takeyuki Tamura:
A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree. Algorithms 6(1): 119-135 (2013)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.