检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:黄东泉
机构地区:[1]Fuzhou University,Fuzhou
出 处:《Journal of Electronics(China)》1990年第2期163-166,共4页电子科学学刊(英文版)
基 金:This project supported by National Natural Science Foundation of China
摘 要:The problem for the solvability of pseudo-tearing subnetwork is one of the essentialinvestigations of network theory.The results presented would be not only mathematical conditionsbut also topological conditions for subnetwork solvability.These conditions are necessary andalmost sufficient.It should guide one intuitively to the design of accessible nodes.The problem for the solvability of pseudo-tearing subnetwork is one of the essential investigations of network theory.The results presented would be not only mathematical conditions but also topological conditions for subnetwork solvability.These conditions are necessary and almost sufficient.It should guide one intuitively to the design of accessible nodes.
关 键 词:Pseudo-tearing SUBNETWORK Indirectly accessible terminals DISTINCT terminals independent PATHS
分 类 号:TN01[电子电信—物理电子学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.43