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.
机构:
Dept Pure Math & Math Stat, Wilberforce Rd, Cambridge CB3 0WB, England
Univ Memphis, Dept Math Sci, Memphis, TN 38152 USA
London Inst Math Sci, 35a South St, London W1K 2XF, EnglandDept Pure Math & Math Stat, Wilberforce Rd, Cambridge CB3 0WB, England
Bollobas, Bela
Janson, Svante
论文数: 0引用数: 0
h-index: 0
机构:
Uppsala Univ, Dept Math, POB 480, SE-75106 Uppsala, SwedenDept Pure Math & Math Stat, Wilberforce Rd, Cambridge CB3 0WB, England
Janson, Svante
Scott, Alex
论文数: 0引用数: 0
h-index: 0
机构:
Univ Oxford, Radcliffe Observ Quarter, Math Inst, Andrew Wiles Bldg,Woodstock Rd, Oxford OX2 6GG, EnglandDept Pure Math & Math Stat, Wilberforce Rd, Cambridge CB3 0WB, England