Linear time recognition algorithms and structure theorems for bipartite tolerance graphs and bipartite probe interval graphs

被引:0
|
作者
Department of Mathematics and Statistics, Utah State University, Logan, UT 84341-3900, United States [1 ]
不详 [2 ]
不详 [3 ]
机构
来源
关键词
Compilation and indexing terms; Copyright 2025 Elsevier Inc;
D O I
暂无
中图分类号
学科分类号
摘要
Graph theory - Graphic methods
引用
收藏
相关论文
共 50 条
  • [11] 2 ALGORITHMS FOR BIPARTITE GRAPHS
    DULMAGE, AL
    MENDELSOHN, NS
    JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1963, 11 (01): : 183 - 194
  • [12] Linear-time recognition of bipartite graphs plus two edges
    Damaschke, P
    DISCRETE MATHEMATICS, 2003, 262 (1-3) : 99 - 112
  • [13] Forbidden subgraph characterization of bipartite unit probe interval graphs
    Brown, David E.
    Langley, Larry J.
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2012, 52 : 19 - 31
  • [14] LINEAR-TIME RECOGNITION OF PROBE INTERVAL GRAPHS
    Mcconnell, Ross M.
    Nussbaum, Yahav
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2015, 29 (04) : 2006 - 2046
  • [15] Linear-Time Recognition of Probe Interval Graphs
    McConnell, Ross M.
    Nussbaum, Yahav
    ALGORITHMS - ESA 2009, PROCEEDINGS, 2009, 5757 : 349 - +
  • [16] Linear-time algorithms for counting independent sets in bipartite permutation graphs
    Lin, Min-Sheng
    Chen, Chien-Min
    INFORMATION PROCESSING LETTERS, 2017, 122 : 1 - 7
  • [17] Interval incidence coloring of bipartite graphs
    Janczewski, Robert
    Malafiejska, Anna
    Malafiejski, Michal
    DISCRETE APPLIED MATHEMATICS, 2014, 166 : 131 - 140
  • [18] Interval Minors of Complete Bipartite Graphs
    Mohar, Bojan
    Rafiey, Arash
    Tayfeh-Rezaie, Behruz
    Wu, Hehui
    JOURNAL OF GRAPH THEORY, 2016, 82 (03) : 312 - 321
  • [19] Scheduling with conflicts on bipartite and interval graphs
    Irani, S
    Leung, V
    JOURNAL OF SCHEDULING, 2003, 6 (03) : 287 - 307
  • [20] Scheduling with Conflicts on Bipartite and Interval Graphs
    Sandy Irani
    Vitus Leung
    Journal of Scheduling, 2003, 6 : 287 - 307