共 50 条
Ambiguity and hypergraphs
被引:0
|作者:
Minnaja, C
机构:
[1] Univ Padua, IT-35131 Padua, Italy
[2] Akad Int Sciencoj San Marino, Dipartimento Matemat, IT-35131 Padua, Italy
来源:
CYBERNETICA
|
1998年
/
41卷
/
01期
关键词:
D O I:
暂无
中图分类号:
TP3 [计算技术、计算机技术];
学科分类号:
0812 ;
摘要:
After a short review of the state of the arf about ambiguities a mathematical formalization of some types of structural ambiguities is offered via graphs. The dependency frees can be arranged as hypergraphs, with nodes linked by several arcs. The various ambiguities are divided into two families, producing hypergraphs without cycles or with them, respectively. For this second family the name of gravitational ambiguity is proposed.
引用
收藏
页码:49 / 56
页数:8
相关论文