Node rewriting in graphs and hypergraphs: a categorical framework

被引：5
|
作者：
Bauderon, M [1 ]
Jacquet, H [1 ]
机构：
[1] Univ Bordeaux 1, Lab Bordelais Rech Informat, F-33405 Talence, France
来源：
THEORETICAL COMPUTER SCIENCE | 2001年 / 266卷 / 1-2期
关键词：
node rewriting; pullback; graphs; hypergraphs;
D O I：
10.1016/S0304-3975(00)00200-0
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：463 / 487
页数：25
相关论文
共 50 条
  • [41] A unified categorical approach for attributed graph rewriting
    Rebout, Maxime
    Feraud, Louis
    Soloviev, Sergei
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2008, 5010 : 398 - 409
  • [42] Aggregating Hypergraphs by Node Attributes
    Trye, David
    Apperley, Mark
    Bainbridge, David
    GRAPH DRAWING AND NETWORK VISUALIZATION, GD 2022, 2023, 13764 : 487 - 489
  • [43] Coloring properties of categorical product of general Kneser hypergraphs
    Sani, Roya Abyazi
    Alishahi, Meysam
    Taherkhani, Ali
    ARS MATHEMATICA CONTEMPORANEA, 2018, 15 (01) : 113 - 126
  • [44] Concurrent rewriting for graphs with equivalences
    Baldan, Paolo
    Gadducci, Fabio
    Montanari, Ugo
    CONCUR 2006 - CONCURRENCY THEORY, PROCEEDINGS, 2006, 4137 : 279 - 294
  • [45] AN ALGEBRA OF GRAPHS AND GRAPH REWRITING
    CORRADINI, A
    MONTANARI, U
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 530 : 236 - 260
  • [46] Parallel rewriting of attributed graphs
    de la Tour, Thierry Boy
    Echahed, Rachid
    THEORETICAL COMPUTER SCIENCE, 2020, 848 : 106 - 132
  • [47] Multi-node graphs: A framework for multiplexed biological assays
    Alon, Noga
    Asodi, Vera
    Cantor, Charles
    Kasif, Simon
    Rachlin, John
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2006, 13 (10) : 1659 - 1672
  • [48] Unsupervised framework for evaluating and explaining structural node embeddings of graphs
    Dehghan, Ashkan
    Siuta, Kinga
    Skorupka, Agata
    Betlen, Andrei
    Miller, David
    Kaminski, Bogumil
    Pralat, Pawel
    JOURNAL OF COMPLEX NETWORKS, 2024, 12 (02)
  • [49] IGE plus : A Framework for Learning Node Embeddings in Interaction Graphs
    Zhang, Yao
    Xiong, Yun
    Kong, Xiangnan
    Niu, Zhuang
    Zhu, Yangyong
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2021, 33 (03) : 1032 - 1044
  • [50] Algorithms for Secretary Problems on Graphs and Hypergraphs
    Korula, Nitish
    Pal, Martin
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT II, PROCEEDINGS, 2009, 5556 : 508 - +
12345