Charbit, P, Habib, M, Trotignon, N et al. (1 more author) (2012) Detecting 2-joins faster. Journal of Discrete Algorithms, 17. 60 - 66. ISSN 1570-8675
Abstract
2-Joins are edge cutsets that naturally appear in the decomposition of several classes of graphs closed under taking induced subgraphs, such as balanced bipartite graphs, even-hole-free graphs, perfect graphs and claw-free graphs. Their detection is needed in several algorithms, and is the slowest step for some of them. The classical method to detect a 2-join takes O(n 3m) time where n is the number of vertices of the input graph and m is the number of its edges. To detect non-path 2-joins (special kinds of 2-joins that are needed in all of the known algorithms that use 2-joins), the fastest known method takes time O(n4m). Here, we give an O(n 2m)-time algorithm for both of these problems. A consequence is a speed-up of several known algorithms.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Keywords: | 2-Join; Detection |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 15 Oct 2014 11:05 |
Last Modified: | 22 Apr 2015 10:13 |
Published Version: | http://dx.doi.org/10.1016/j.jda.2012.11.003 |
Status: | Published |
Publisher: | Elsevier |
Identification Number: | 10.1016/j.jda.2012.11.003 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:78857 |