Directed recursive labelnode hypergraphs: A new representation-language
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3821125 (Why is no real title available?)
- scientific article; zbMATH DE number 3780596 (Why is no real title available?)
- scientific article; zbMATH DE number 3519854 (Why is no real title available?)
- scientific article; zbMATH DE number 3441641 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- scientific article; zbMATH DE number 3089078 (Why is no real title available?)
- A language extension for graph processing and its formal semantics
- A relational model of data for large shared data banks
- Efficient Utilization of Non-Numerical Information in Quantitative Analysis General Theory and the Case of Simple Order
Cited in
(8)- Dynamic maintenance of directed hypergraphs
- Partially dynamic maintenance of minimum weight hyperpaths
- Dynamic maintenance of the transitive closure in disjunctive graphs
- Directed hypergraphs and applications
- Generating functions of some families of directed uniform hypergraphs
- Declarative operations on nets
- Directed hypergraphs: introduction and fundamental algorithms -- a survey
- Linear time analysis of properties of conflict-free and general Petri nets
This page was built for publication: Directed recursive labelnode hypergraphs: A new representation-language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1239014)
