RECURSIVE RELATION FOR COUNTING THE COMPLEXITY OF BUTTERFLY MAP

DOUNIA LOTFI; MOHAMED EL MARRAKI; ABDULHAFID MODABISH

首页> 外文期刊>Journal of Theoretical and Applied Information Technology >RECURSIVE RELATION FOR COUNTING THE COMPLEXITY OF BUTTERFLY MAP

【24h】

RECURSIVE RELATION FOR COUNTING THE COMPLEXITY OF BUTTERFLY MAP

机译：计算蝶形图复杂度的递归关系

获取原文

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

Graph theory is used to represent a communication network by expressing its linkage structure, the vertices represent objects and the pairs called edges or represent the interconnections between objects. The exact geometric positions of vertices or the le

机译：图论通过表达其链接结构来表示通信网络，顶点表示对象，称为边缘的对或表示对象之间的互连。顶点或顶点的确切几何位置

著录项

来源
《Journal of Theoretical and Applied Information Technology》 |2011年第1期|共页
作者
DOUNIA LOTFI; MOHAMED EL MARRAKI; ABDULHAFID MODABISH;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种
中图分类计算技术、计算机技术;
关键词

相似文献

外文文献
中文文献
专利

1. Finite Generators for Countable Group Actions; Finite Index Pairs of Equivalence Relations; Complexity Measures for Recursive Programs [J] . AnushTserunyan The bulletin of symbolic logic . 2018,第4期

机译：有限发电机可用于可数群体行动; 有限索引对等同性关系; 递归程序的复杂性措施
2. Low-Complexity Selected Mapping Scheme Using a Bank of Butterfly Circuits in Orthogonal Frequency Division Multiplexing Systems [J] . Sairam M. V. S., Riyaz Shaik, Madhu R., Wireless personal communications: An Internaional Journal . 2018,第3期

机译：低复杂度使用正交频分复用系统中的蝴蝶电路的映射方案
3. On relations between counting communication complexity classes [J] . Damm C, Krause M, Meinel C, Journal of computer and system sciences . 2004,第2期

机译：关于计算通信复杂度等级之间的关系
4. Frequency assignment maps, relation to system invariants and bounded complexity solutions [C] . Leventides, J., Karcanias, . 1996

机译：频率分配图，与系统不变性和有界复杂度解决方案的关系
5. North American butterfly association counts at Congaree National Park: A case study for connecting citizen science to management. [D] . Clarridge, Austin. 2016

机译：北美蝴蝶协会在Congaree国家公园十分重视：一项将公民科学与管理联系起来的案例研究。
6. A physical map of Brassica oleracea shows complexity of chromosomal changes following recursive paleopolyploidizations [O] . Xiyin Wang, Manuel J Torres, Gary Pierce, 2011

机译：甘蓝型油菜的物理图谱显示了递归古多倍体化后染色体变化的复杂性
7. Semantic Maps or Coding Maps? Towards a Unified Account of the Coding Degree, Coding Complexity, and Coding Distance of Coordination Relations [O] . Caterina Mauri 2010

机译：语义地图或编码地图？关于编码度，编码复杂度和协调关系编码距离的统一说明
8. Counting Binary, Rooted Trees Arboreal Numbers of the First and Second Kind. Ii. A Recursive Formula for Counting N-Ary Rooted Trees [R] . Weston, P., Ryan, H. F. 1966

机译：计算第一类和第二类树的二元树，根树数。二。计算N元根树的递推公式

RECURSIVE RELATION FOR COUNTING THE COMPLEXITY OF BUTTERFLY MAP

摘要

著录项

相似文献

相关主题

期刊订阅