GENERALIZATION OF DILWORTHS THEOREM TO ACYCLIC DIRECTED GRAPHS

被引:0
|
作者
DEMING, RW [1 ]
机构
[1] SUNY, COLL OSWEGO, OSWEGO, NY USA
来源
关键词
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:A452 / A453
页数:2
相关论文
共 50 条
  • [1] A GENERALIZATION OF TURAN THEOREM TO DIRECTED GRAPHS
    MAURER, SB
    RABINOVITCH, I
    TROTTER, WT
    DISCRETE MATHEMATICS, 1980, 32 (02) : 167 - 189
  • [2] GENERALIZATION OF DILWORTHS THEOREM ON MINIMAL CHAIN DECOMPOSITION
    RAGHAVACHARI, M
    MOTE, VL
    MANAGEMENT SCIENCE SERIES A-THEORY, 1970, 16 (07): : 508 - 511
  • [3] Labeled directed acyclic graphs: a generalization of context-specific independence in directed graphical models
    Johan Pensar
    Henrik Nyman
    Timo Koski
    Jukka Corander
    Data Mining and Knowledge Discovery, 2015, 29 : 503 - 533
  • [4] Labeled directed acyclic graphs: a generalization of context-specific independence in directed graphical models
    Pensar, Johan
    Nyman, Henrik
    Koski, Timo
    Corander, Jukka
    DATA MINING AND KNOWLEDGE DISCOVERY, 2015, 29 (02) : 503 - 533
  • [5] DILWORTHS DECOMPOSITION THEOREM
    OELLRICH, H
    STEFFENS, K
    DISCRETE MATHEMATICS, 1976, 15 (03) : 301 - 304
  • [6] DILWORTHS CODING THEOREM
    FAN, K
    MATHEMATISCHE ZEITSCHRIFT, 1972, 127 (01) : 92 - &
  • [7] Acyclic Partitioning of Large Directed Acyclic Graphs
    Herrmann, Julien
    Kho, Jonathan
    Ucar, Bora
    Kaya, Kamer
    Catalyurek, Umit V.
    2017 17TH IEEE/ACM INTERNATIONAL SYMPOSIUM ON CLUSTER, CLOUD AND GRID COMPUTING (CCGRID), 2017, : 371 - 380
  • [8] Counting acyclic orderings in directed acyclic graphs
    Fox, Joseph
    Judd, Aimee
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2020, 115 : 271 - 286
  • [9] Seepage in directed acyclic graphs
    Clarke, N. E.
    Finbow, S.
    Fitzpatrick, S. L.
    Messenger, M. E.
    Nowakowski, R. J.
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2009, 43 : 91 - 102
  • [10] ON MERGINGS IN ACYCLIC DIRECTED GRAPHS
    Han, Guangyue
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2019, 33 (03) : 1482 - 1502