Node rewriting in hypergraphs
type: Item
instance of: scholarly article
title: Node rewriting in hypergraphs
zbMATH Open document ID: 1539.68124
DOI: 10.1007/3-540-62559-3_4
author: M. Bauderon
author: H. Jacquet
publication date: 2024-06-05T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 7860242
zbMATH Keywords: bipartite graph
zbMATH Keywords: graph grammar
zbMATH Keywords: sentential form
zbMATH Keywords: incident vertex
zbMATH Keywords: connection relation
MaRDI profile type: Publication
cites work: A category-theoretical approach to vertex replacement: The generation of infinite graphs
cites work: A uniform approach to graph rewriting: The pullback approach
cites work: Graph expressions and graph rewritings
cites work: An axiomatic definition of context-free rewriting and its application to NLC graph grammars
cites work: Q4385531
cites work: Handle-rewriting hypergraph grammars
cites work: A comparison of boundary graph grammars and context-free hypergraph grammars
cites work: Q4037292
cites work: Context-free graph languages of bounded degree are generated by apex graph grammars
cites work: Q4194478
cites work: Kronecker Products and Local Joins of Graphs
cites work: On the structure of node-label-controlled graph languages
cites work: Graph grammars with neighbourhood-controlled embedding
cites work: HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting
cites work: Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence
cites work: Q5639839
cites work: On hyperedge replacement and BNLC graph grammars
description: scientific article; zbMATH DE number 7860242