Finding a Forest in a Tree

DOI10.1007/978-3-662-45917-1_2zbMath1444.68134OpenAlexW1868925754MaRDI QIDQ2811922

Giorgio Bacci, Romeo Rizzi, Marino Miculan

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) Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Related Items (2)

Executing bigraphical reactive systems ⋮ Computing Embeddings of Directed Bigraphs

Cites Work

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

This page was built for publication: Finding a Forest in a Tree