A Characterization of Mixed Branching Greedoids

被引：0
|
作者：
Steven J. Tedford
机构：
[1] Franklin and Marshall College,Department of Mathematical Sciences
来源：
Annals of Combinatorics | 2007年 / 11卷
关键词：
05B99; 05C99; greedoid; forbidden minor; rooted mixed graph;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Branching greedoids have been defined and characterized for both directed and undirected rooted graphs. Such greedoids can be extended to rooted mixed graphs – graphs with both directed and undirected edges. These greedoids are characterized by a list of forbidden minors.
引用
收藏
页码：79 / 100
页数：21
相关论文
共 50 条
  • [21] GREEDOIDS AND LINEAR OBJECTIVE FUNCTIONS
    KORTE, B
    LOVASZ, L
    SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1984, 5 (02): : 229 - 238
  • [22] THE CHARACTERIZATION OF BRANCHING DEPENDENCIES
    DEMETROVICS, J
    KATONA, GOH
    SALI, A
    DISCRETE APPLIED MATHEMATICS, 1992, 40 (02) : 139 - 153
  • [23] On local maximum stable set greedoids
    Levit, Vadim E.
    Mandrescu, Eugen
    DISCRETE MATHEMATICS, 2012, 312 (03) : 588 - 596
  • [24] New polyhedral and algorithmic results on greedoids
    Dávid Szeszlér
    Mathematical Programming, 2021, 185 : 275 - 296
  • [25] A greedy algorithm for interval greedoids
    Mao, Hua
    OPEN MATHEMATICS, 2018, 16 : 260 - 267
  • [26] Decomposition Branching for Mixed Integer Programming
    Yildiz, Baris
    Boland, Natashia
    Savelsbergh, Martin
    OPERATIONS RESEARCH, 2022, 70 (03) : 1854 - 1872
  • [27] Sufficient conditions for the optimality of the greedy algorithm in greedoids
    Dávid Szeszlér
    Journal of Combinatorial Optimization, 2022, 44 : 287 - 302
  • [28] Sufficient conditions for the optimality of the greedy algorithm in greedoids
    Szeszler, David
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 44 (01) : 287 - 302
  • [29] Categories of (I, I)-Fuzzy Greedoids
    Xiu, Zhen-Yu
    Shi, Fu-Gui
    JOURNAL OF FUNCTION SPACES, 2015, 2015
  • [30] BRANCHINGS IN ROOTED GRAPHS AND THE DIAMETER OF GREEDOIDS
    ZIEGLER, GM
    COMBINATORICA, 1988, 8 (02) : 217 - 234
12345