Efficient algorithms for Petersen's matching theorem

被引：45

作者：

Biedl, TC ^{[1
]}

Bose, P

Demaine, ED

Lubiw, A

机构：

[1] Univ Waterloo, Dept Comp Sci, Waterloo, ON N2L 3G1, Canada

[2] Carleton Univ, Sch Comp Sci, Ottawa, ON K1S 5B6, Canada

[3] McGill Univ, Montreal, PQ H3A 2T5, Canada

来源：

JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC | 2001年 / 38卷 / 01期

关键词：

Petersen's theorem; perfect matching; 3-regular graphs;

D O I：

10.1006/jagm.2000.1132

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Petersen's theorem is a classic result in matching theory from 1891, stating that every 3-regular bridgeless graph has a perfect matching. Our work explores efficient algorithms for finding perfect matchings in such graphs. Previously, the only relevant matching algorithms were for general graphs, and the fastest algorithm ran in O(n(3/2)) time fur 3-regular graphs. We have developed an O(n log(4) n)-time algorithm for perfect matching in a 3-regular bridgeless graph. When the graph is also planar, ne have as the main result of our paper an optimal O(n)-time algorithm. We present three applications of this result: terrain guarding, adaptive mesh refinement, and quadrangulation. (C) 2001 Academic Press.

引用

页码：110 / 134

页数：25

共 50 条

[31] On Gurevich's theorem on sequential algorithms
Reisig, W
ACTA INFORMATICA, 2003, 39 (04) : 273 - 305
[32] On Helly's Theorem: Algorithms and Extensions
A. Brieden
P. Gritzmann
Discrete & Computational Geometry, 1997, 17 : 393 - 410
[33] Simple and Efficient Pattern Matching Algorithms for Biological Sequences
Neamatollahi, Peyman
Hadi, Montassir
Naghibzadeh, Mahmoud
IEEE ACCESS, 2020, 8 (08): : 23838 - 23846
[34] Seeded Graph Matching: Efficient Algorithms and Theoretical Guarantees
Shirani, Farhad
Garg, Siddharth
Erkip, Elza
2017 FIFTY-FIRST ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS, AND COMPUTERS, 2017, : 253 - 257
[35] EFFICIENT LABELING ALGORITHMS FOR THE MAXIMUM NONCROSSING MATCHING PROBLEM
MALUCELLI, F
OTTMANN, T
PRETOLANI, D
DISCRETE APPLIED MATHEMATICS, 1993, 47 (02) : 175 - 179
[36] Efficient approximation algorithms for the maximum weight matching problem
Takafuji, D
Taoka, S
Watanabe, T
2002 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL IV, PROCEEDINGS, 2002, : 457 - 460
[37] Efficient string matching algorithms for combinatorial universal denoising
Chen, S
Diggavi, S
Dusad, S
Muthukrishnan, S
DCC 2005: Data Compression Conference, Proceedings, 2005, : 153 - 162
[38] Efficient algorithms for pattern matching on directed acyclic graphs
Chen, L
Gupta, A
Kurul, ME
ICDE 2005: 21ST INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS, 2005, : 384 - 385
[39] EFFICIENT ALGORITHMS FOR FINDING MAXIMUM MATCHING IN GRAPHS.
Galil, Zvi
Computing surveys, 1986, 18 (01): : 23 - 38
[40] Exploring efficient grouping algorithms in regular expression matching
Xu, Chengcheng
Su, Jinshu
Chen, Shuhui
PLOS ONE, 2018, 13 (10):

← 1 2 3 4 5 →