%0 Journal Article %1 journals/algorithms/AkutsuT13 %A Akutsu, Tatsuya %A Tamura, Takeyuki %D 2013 %J Algorithms %K dblp %N 1 %P 119-135 %T A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree. %U http://dblp.uni-trier.de/db/journals/algorithms/algorithms6.html#AkutsuT13 %V 6

@article{journals/algorithms/AkutsuT13, added-at = {2023-08-28T00:00:00.000+0200}, author = {Akutsu, Tatsuya and Tamura, Takeyuki}, biburl = {https://www.bibsonomy.org/bibtex/2dbf84afc976b779575a9e5fadfc8fd64/dblp}, ee = {https://www.wikidata.org/entity/Q115926164}, interhash = {7e478a09bb479a56149307bae0bc2c73}, intrahash = {dbf84afc976b779575a9e5fadfc8fd64}, journal = {Algorithms}, keywords = {dblp}, number = 1, pages = {119-135}, timestamp = {2024-04-09T05:18:52.000+0200}, title = {A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree.}, url = {http://dblp.uni-trier.de/db/journals/algorithms/algorithms6.html#AkutsuT13}, volume = 6, year = 2013 }