FINDING THE MINIMUM BANDWIDTH OF AN INTERVAL GRAPH

被引：19
|
作者：
KRATSCH, D
机构：
来源：
INFORMATION AND COMPUTATION | 1987年 / 74卷 / 02期
关键词：
D O I：
10.1016/0890-5401(87)90028-9
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：140 / 158
页数：19
相关论文
共 50 条
  • [41] Finding a Minimum-depth Embedding of a Planar Graph in O(n4) Time
    Patrizio Angelini
    Giuseppe Di Battista
    Maurizio Patrignani
    Algorithmica, 2011, 60 : 890 - 937
  • [42] MINIMUM BANDWIDTH DICODE SIGNALING
    COURT, FC
    JOURNAL OF THE INSTITUTION OF ELECTRONIC AND RADIO ENGINEERS, 1986, 56 (04): : 159 - 168
  • [43] SWITCHING SIGNALS WITH MINIMUM BANDWIDTH
    HADDAD, E
    INTERNATIONAL JOURNAL OF ELECTRONICS, 1977, 42 (05) : 489 - 496
  • [44] Graph bandwidth of weighted caterpillars
    Lin, ZY
    Lin, MG
    Xu, JH
    ALGORITHMIC APPLICATIONS IN MANAGEMENT, PROCEEDINGS, 2005, 3521 : 370 - 380
  • [45] An extremal graph with given bandwidth
    Lai, Yung-Ling
    Tian, Chang-Sin
    THEORETICAL COMPUTER SCIENCE, 2007, 377 (1-3) : 238 - 242
  • [46] Interval Graph Limits
    Diaconis, Persi
    Holmes, Susan
    Janson, Svante
    ANNALS OF COMBINATORICS, 2013, 17 (01) : 27 - 52
  • [47] Interval graph mining
    Kemmar, Amina
    Lebbah, Yahia
    Loudni, Samir
    INTERNATIONAL JOURNAL OF DATA MINING MODELLING AND MANAGEMENT, 2018, 10 (01) : 1 - 22
  • [48] Graph bandwidth of weighted caterpillars
    Lin, Mingen
    Lin, Zhiyong
    Xu, Jinhui
    THEORETICAL COMPUTER SCIENCE, 2006, 363 (03) : 266 - 277
  • [49] Interval Graph Limits
    Persi Diaconis
    Susan Holmes
    Svante Janson
    Annals of Combinatorics, 2013, 17 : 27 - 52
  • [50] Cyclic bandwidth sum of graph
    Hao J.
    Applied Mathematics-A Journal of Chinese Universities, 2001, 16 (2) : 115 - 121
12345