Finding a forest in a tree

DOI10.1007/978-3-662-45917-1_2MaRDI QIDQ2811922zbMATH OpenOpenAlexFDO

Authors Giorgio Bacci, Marino Miculan, Romeo Rizzi

Publication date 9 June 2016

Published in Trustworthy Global Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-45917-1_2

Mathematics Subject Classification ID

Trees (05C05) Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Reaction graph
• scientific article; zbMATH DE number 1863157
• On the complexity of concurrent multiset rewriting
• Reactive Systems over Directed Bigraphs
• Bigraphs with sharing

Cites work

• A\,V^ 2 algorithm for determining isomorphism of planar graphs
• A rewriting logic approach to operational semantics
• An inductive characterization of matching in binding bigraphs
• Bigraphs and transitions
• Efficient graph rewriting and its implementation
• Fixed-Parameter Tractability and Completeness I: Basic Results
• Fourier meets M\"{o}bius: fast subset convolution
• scientific article; zbMATH DE number 3575612 (Why is no real title available?)
• scientific article; zbMATH DE number 1889386 (Why is no real title available?)
• On Problems without Polynomial Kernels (Extended Abstract)
• Stochastic bigraphs
• Subtree Isomorphism in O(n5/2)
• Synchronised Hyperedge Replacement as a Model for Service Oriented Computing
• The complexity of theorem-proving procedures
• The Space and Motion of Communicating Agents

Cited in

(3)

• Executing bigraphical reactive systems
• Searching a Tree with Permanently Noisy Advice
• Computing embeddings of directed bigraphs

This page was built for publication: Finding a forest in a tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811922)