[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.
机构:
Univ Michigan, Dept Math, Ann Arbor, MI 48109 USA
Univ Michigan, Dept Elect Engn & Comp Sci, Ann Arbor, MI 48109 USAUniv Michigan, Dept Math, Ann Arbor, MI 48109 USA
Chen, Can
Surana, Amit
论文数: 0引用数: 0
h-index: 0
机构:
Raytheon Technol Res Ctr, E Hartford, CT 06108 USAUniv Michigan, Dept Math, Ann Arbor, MI 48109 USA
Surana, Amit
Bloch, Anthony M.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Michigan, Dept Math, Ann Arbor, MI 48109 USAUniv Michigan, Dept Math, Ann Arbor, MI 48109 USA
Bloch, Anthony M.
Rajapakse, Indika
论文数: 0引用数: 0
h-index: 0
机构:
Univ Michigan, Dept Math, Ann Arbor, MI 48109 USA
Univ Michigan, Dept Computat Med & Bioinformat, Med Sch, Ann Arbor, MI 48109 USAUniv Michigan, Dept Math, Ann Arbor, MI 48109 USA
Rajapakse, Indika
IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING,
2021,
8
(02):
: 1646
-
1657