首页   按字顺浏览 期刊浏览 卷期浏览 Searching for an edge in a graph
Searching for an edge in a graph

 

作者: M. Aigner,   E. Triesch,  

 

期刊: Journal of Graph Theory  （WILEY Available online 1988）
卷期: Volume 12, issue 1  

页码: 45-57

 

ISSN:0364-9024

 

年代: 1988

 

DOI:10.1002/jgt.3190120106

 

出版商: Wiley Subscription Services, Inc., A Wiley Company

 

数据来源: WILEY

 

摘要:

AbstractConsider the problem of determining the endpoints of an unknown edge x in a given graph G by asking questions of the form “Is vertexvan endpoint of edgeein G?”. Sharp upper and lower bounds are derived, and it is shown that determining the minimum number of questions in NP‐com

 

点击下载:  PDF (483KB)



返 回