ON FINDING SIMPLE PATHS AND CIRCUITS IN A GRAPH

被引：32
作者：
DANIELSON, GH
机构：
来源：
IEEE TRANSACTIONS ON CIRCUIT THEORY | 1968年 / CT15卷 / 03期
关键词：
D O I：
10.1109/TCT.1968.1082837
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
引用
收藏
页码：294 / +
页数：1
相关论文
共 6 条
[1]   COMPUTER RECOGNITION AND EXTRACTION OF PLANAR GRAPHS FROM INCIDENCE MATRIX [J].
FISHER, GJ ;
WING, O .
IEEE TRANSACTIONS ON CIRCUIT THEORY, 1966, CT13 (02) :154-&
[2]   ALL PATHS THROUGH A MAZE [J].
KROFT, D .
PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1967, 55 (01) :88-&
[3]  
ORE O, 1962, THEORY GRAPHYS, V38
[4]   PATHFINDING THROUGH A COMMUNICATION NETWORK [J].
PAZ, IM .
PROCEEDINGS OF THE INSTITUTION OF ELECTRICAL ENGINEERS-LONDON, 1967, 114 (01) :76-&
[5]  
PONSTEIN J, 1966, J SIAM APPL MATH, P600
[6]   GENERATION OF ALL HAMILTONIAN CIRCUITS PATHS AND CENTERS OF A GRAPH AND RELATED PROBLEMS [J].
YAU, SS .
IEEE TRANSACTIONS ON CIRCUIT THEORY, 1967, CT14 (01) :79-&
1