A Faster Algorithm for Maximum Induced Matchings on Circle Graphs

Max Hector Ward-Graham, Andrew Gozzard, Michael J. Wise, Amitava Datta

Research output: Contribution to journalArticle

Abstract

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.
Original languageEnglish
Pages (from-to)389-396
Number of pages8
JournalJournal of Graph Algorithms and Applications
Volume22
Issue number2
DOIs
Publication statusPublished - Aug 2018

Fingerprint

Circle Graph
Induced Matching
Fast Algorithm
Computational chemistry
Bioinformatics
RNA
Computational Chemistry
VLSI Design
Graph Algorithms
Filament
Graph in graph theory
Bipartite Graph
Computational Cost
NP-complete problem
Costs
Interval

Cite this

@article{89ee9da0f6324e419b82834c2d400cf7,
title = "A Faster Algorithm for Maximum Induced Matchings on Circle Graphs",
abstract = "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.",
author = "Ward-Graham, {Max Hector} and Andrew Gozzard and Wise, {Michael J.} and Amitava Datta",
year = "2018",
month = "8",
doi = "10.7155/jgaa.00476",
language = "English",
volume = "22",
pages = "389--396",
journal = "Journal of Graph Algorithms and Applications",
issn = "1526-1719",
publisher = "Brown University",
number = "2",

}

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

In: Journal of Graph Algorithms and Applications, Vol. 22, No. 2, 08.2018, p. 389-396.

Research output: Contribution to journalArticle

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 -