拟裂子网络可解性的拓扑条件

Download: PDF (974 KB)
Export: BibTeX | EndNote (RIS)

Abstract The problem for the solvability of pseudo-tearing subnetwark is one of essential investigations of network theory. The results presented would be not only a mathematical conditions, but also a topological conditions for subnetwork solvability. It should guide intuitively to the design of accessible nodes.

Key words： Pseudo-tearing subnetwork Indirectly accessible nodes Distinct ended-nodes independent paths

Received: 19 April 1988

	Service

	E-mail this article
	Add to my bookshelf
	Add to citation manager
	E-mail Alert
	RSS
	Articles by authors

	Huang Dongquan

Cite this article:

Huang Dongquan. TOPOLOGICAL CONDITIONS FOR SOLVABILITY OF PSEUDO-TEARING SUBNETWORK[J]. , 1989, 11(4): 394-399 .

URL:

http://jeit.ie.ac.cn/EN/ OR http://jeit.ie.ac.cn/EN/Y1989/V11/I4/394

No Similar of article