The induced matching and chain subgraph cover problems for convex bipartite graphs

被引：14
|
作者：
Brandstaedt, Andreas
Eschen, Elaine M.
Sritharan, R.
机构：
[1] W Virginia Univ, Lane Dept Comp Sci & Elect Engn, Morgantown, WV 26506 USA
[2] Univ Rostock, Inst Informat, D-18051 Rostock, Germany
[3] Univ Dayton, Dept Comp Sci, Dayton, OH 45469 USA
来源：
THEORETICAL COMPUTER SCIENCE | 2007年 / 381卷 / 1-3期
关键词：
chain cover; induced matching; convex bipartite graph;
D O I：
10.1016/j.tcs.2007.04.006
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present an O(n(2))-time algorithm for computing a maximum cardinality induced matching and a minimum cardinality cover by chain subgraphs for convex bipartite graphs. This improves the previous time bound of O(m(2)). (c) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码：260 / 265
页数：6
相关论文
共 50 条
  • [1] SOME MATCHING PROBLEMS FOR BIPARTITE GRAPHS
    ITAI, A
    RODEH, M
    TANIMOTO, SL
    [J]. JOURNAL OF THE ACM, 1978, 25 (04) : 517 - 525
  • [2] Solving Matching Problems Efficiently in Bipartite Graphs
    Djelloul, Selma
    [J]. COMBINATORIAL ALGORITHMS, IWOCA 2014, 2015, 8986 : 128 - 139
  • [3] Convex bipartite graphs and bipartite circle graphs
    Kizu, T
    Haruta, Y
    Araki, T
    Kashiwabara, T
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1998, E81A (05) : 789 - 795
  • [4] BSP/CGM algorithm for maximum matching in convex bipartite graphs
    Soares, J
    Stefanes, M
    [J]. 15TH SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING, PROCEEDINGS, 2003, : 167 - 174
  • [5] CIRCULAR CONVEX BIPARTITE GRAPHS - MAXIMUM MATCHING AND HAMILTONIAN CIRCUITS
    LIANG, YD
    BLUM, N
    [J]. INFORMATION PROCESSING LETTERS, 1995, 56 (04) : 215 - 219
  • [6] Coarse grained parallel maximum matching in convex bipartite graphs
    Bose, P
    Chan, A
    Dehne, F
    Latzel, M
    [J]. IPPS/SPDP 1999: 13TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM & 10TH SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 1999, : 125 - 129
  • [7] A PARALLEL MATCHING ALGORITHM FOR CONVEX BIPARTITE GRAPHS AND APPLICATIONS TO SCHEDULING
    DEKEL, E
    SAHNI, S
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1984, 1 (02) : 185 - 205
  • [8] Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs
    Heggernes, Pinar
    van 't Hof, Pim
    Meister, Daniel
    Villanger, Yngve
    [J]. THEORETICAL COMPUTER SCIENCE, 2015, 562 : 252 - 269
  • [9] ON THE 2-CHAIN SUBGRAPH COVER AND RELATED PROBLEMS
    MA, TH
    SPINRAD, JP
    [J]. JOURNAL OF ALGORITHMS, 1994, 17 (02) : 251 - 268
  • [10] Induced Matching in Some Subclasses of Bipartite Graphs
    Pandey, Arti
    Panda, B. S.
    Dane, Piyush
    Kashyap, Manav
    [J]. ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, 2017, 10156 : 308 - 319
12345