Skip to main content
Conference Proceedings

Node rewriting in hypergraphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1997) 1197 LNCS 31-43
DOI: 10.1007/3-540-62559-3_4
4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Pullback rewriting has recently been introduced as a new and unifying paradigm for vertex rewriting in graphs. In this paper we show how to extend it to describe in a uniform way more rewriting mechanisms such as node and handle rewriting in hypergraphs.

Cite

CITATION STYLE

APA

Bauderon, M., & Jacquet, H. (1997). Node rewriting in hypergraphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1197 LNCS, pp. 31–43). https://doi.org/10.1007/3-540-62559-3_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free