首页   按字顺浏览 期刊浏览 卷期浏览 An edge‐oriented adjacency list for undirected graphs
An edge‐oriented adjacency list for undirected graphs

 

作者: L. K. Chen,   B. S. Ting,   A. Sangiovanni‐Vincentelli,  

 

期刊: International Journal of Circuit Theory and Applications  （WILEY Available online 1979）
卷期: Volume 7, issue 1  

页码: 55-63

 

ISSN:0098-9886

 

年代: 1979

 

DOI:10.1002/cta.4490070107

 

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

 

数据来源: WILEY

 

摘要:

AbstractA new data structure, called the Edge‐Oriented Adjacency List (EOAL), for representing undirected graphs is presented. It provides more information on the edges and requires less storage space than the conventional adjacency list. Furthermore, it is superior to the conventional adjacency list in both insertion and deletion operation

 

点击下载:  PDF (415KB)



返 回