EDGE SEARCH IN GRAPHS AND HYPERGRAPHS OF BOUNDED RANK

被引：9
|
作者：
ALTHOFER, I
TRIESCH, E
机构：
[1] UNIV BIELEFELD,FAK MATH,W-4800 BIELEFELD 1,GERMANY
[2] RHEIN WESTFAL TH AACHEN,LEHRSTUHL UNTERNEHMENSFORSCH,W-5100 AACHEN,GERMANY
来源：
DISCRETE MATHEMATICS | 1993年 / 115卷 / 1-3期
关键词：
D O I：
10.1016/0012-365X(93)90473-7
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Given a finite graph G = (V, E), what is the worst-case complexity L(G) of finding an unknown edge e* is-an-element-of E if the following tests are admitted. For any W subset-of V we may test whether e* subset-of W or not. We prove that L(G) less-than-or-equal-to log2 Absolute value of E + 3. This result is generalized to hypergraphs H = (V, E) of bounded rank: For any r, there exists some constant gamma(r) such that L(H) less-than-or-equal-to 1092 Absolute value of E + gamma(r) for any hypergraph with rank less-than-or-equal-to r.
引用
收藏
页码：1 / 9
页数：9
相关论文
共 50 条
  • [31] On the Arithmetical Rank of the Edge Ideals of Some Graphs
    Mohammadi, Fatemeh
    Kiani, Dariush
    ALGEBRA COLLOQUIUM, 2012, 19 : 797 - 806
  • [32] The arithmetical rank of the edge ideals of graphs with whiskers
    Macchia A.
    Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry, 2015, 56 (1): : 147 - 158
  • [33] The arithmetical rank of the edge ideals of cactus graphs
    Barile, Margherita
    Macchia, Antonio
    COMMUNICATIONS IN ALGEBRA, 2017, 45 (12) : 5407 - 5419
  • [34] Trinque problem: covering complete graphs by plane degree-bounded hypergraphs
    Clément Charpentier
    Sylvain Gravier
    Thomas Lecorre
    Journal of Combinatorial Optimization, 2017, 33 : 543 - 550
  • [35] Trinque problem: covering complete graphs by plane degree-bounded hypergraphs
    Charpentier, Clement
    Gravier, Sylvain
    Lecorre, Thomas
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 33 (02) : 543 - 550
  • [36] Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width
    Bordewich, Magnus
    Kang, Ross J.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2014, 21 (04):
  • [37] Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
    Gurvich, Vladimir
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (14) : 3069 - 3085
  • [38] SOME PROPERTIES AND APPLICATIONS OF COMPLETE EDGE-COLORED GRAPHS AND HYPERGRAPHS
    GURVICH, VA
    DOKLADY AKADEMII NAUK SSSR, 1984, 279 (06): : 1306 - 1310
  • [39] Constant delay traversal of grammar -compressed graphs with bounded rank
    Maneth, Sebastian
    Peternek, Fabian
    INFORMATION AND COMPUTATION, 2020, 273
  • [40] Better Polynomial Algorithms on Graphs of Bounded Rank-Width
    Ganian, Robert
    Hlineny, Petr
    COMBINATORIAL ALGORITHMS, 2009, 5874 : 266 - 277
12345