### Abstract

Original language | English |
---|---|

Pages (from-to) | 389-396 |

Number of pages | 8 |

Journal | Journal of Graph Algorithms and Applications |

Volume | 22 |

Issue number | 2 |

DOIs | |

Publication status | Published - Aug 2018 |

### Fingerprint

### Cite this

*Journal of Graph Algorithms and Applications*,

*22*(2), 389-396. https://doi.org/10.7155/jgaa.00476

}

*Journal of Graph Algorithms and Applications*, vol. 22, no. 2, pp. 389-396. https://doi.org/10.7155/jgaa.00476

**A Faster Algorithm for Maximum Induced Matchings on Circle Graphs.** / Ward-Graham, Max Hector; Gozzard, Andrew; Wise, Michael J.; Datta, Amitava.

Research output: Contribution to journal › Article

TY - JOUR

T1 - A Faster Algorithm for Maximum Induced Matchings on Circle Graphs

AU - Ward-Graham, Max Hector

AU - Gozzard, Andrew

AU - Wise, Michael J.

AU - Datta, Amitava

PY - 2018/8

Y1 - 2018/8

N2 - Circle graphs have applications to RNA bioinformatics, computational chemistry, and VLSI design. Additionally, many problems that are intractable on general graphs are efficient for circle graphs. This has driven research into algorithms for circle graphs. One well known graph problem is to find a maximum induced matching. This is NP-Hard, even for bipartite graphs. No algorithm for this problem that works directly on circle graphs has been proposed. However, since circle graphs are included in interval filament graphs, algorithms for this class can be applied to circle graphs. Unfortunately, this entails a large computational cost of O(|V|6) time. We propose an algorithm that operates directly on circle graphs, and requires only O(|V|3) time.

AB - Circle graphs have applications to RNA bioinformatics, computational chemistry, and VLSI design. Additionally, many problems that are intractable on general graphs are efficient for circle graphs. This has driven research into algorithms for circle graphs. One well known graph problem is to find a maximum induced matching. This is NP-Hard, even for bipartite graphs. No algorithm for this problem that works directly on circle graphs has been proposed. However, since circle graphs are included in interval filament graphs, algorithms for this class can be applied to circle graphs. Unfortunately, this entails a large computational cost of O(|V|6) time. We propose an algorithm that operates directly on circle graphs, and requires only O(|V|3) time.

U2 - 10.7155/jgaa.00476

DO - 10.7155/jgaa.00476

M3 - Article

VL - 22

SP - 389

EP - 396

JO - Journal of Graph Algorithms and Applications

JF - Journal of Graph Algorithms and Applications

SN - 1526-1719

IS - 2

ER -