Vertex rewriting in graphs is a very powerful mechanism which has been studied for quite a long time. In this paper we eventually provide a categorical theory of vertex rewriting and show how it can extend in a uniform way to node and pattern rewriting mechanisms in hypergraphs. (C) 2001 Elsevier Science B.V. All rights reserved.
机构:
Univ Calif Los Angeles, Dept Math, Los Angeles, CA 90095 USAUniv Calif Los Angeles, Dept Math, Los Angeles, CA 90095 USA
Ma, Jie
Naves, Humberto
论文数: 0引用数: 0
h-index: 0
机构:
Univ Calif Los Angeles, Dept Math, Los Angeles, CA 90095 USAUniv Calif Los Angeles, Dept Math, Los Angeles, CA 90095 USA
Naves, Humberto
Sudakov, Benny
论文数: 0引用数: 0
h-index: 0
机构:
Univ Calif Los Angeles, Dept Math, Los Angeles, CA 90095 USA
ETH, Dept Math, CH-8092 Zurich, SwitzerlandUniv Calif Los Angeles, Dept Math, Los Angeles, CA 90095 USA