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 条
12345