An inductive characterization of matching in binding bigraphs

DOI10.1007/S00165-011-0184-5MaRDI QIDQ1941899zbMATH OpenOpenAlexFDO

Authors Troels Christoffer Damgaard, Arne John Glenstrup, Lars Birkedal, Robin Milner

Publication date 22 March 2013

Published in Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00165-011-0184-5

zbMATH Keywords

matchingbigraphsbigraphical reactive systemscomplete inductive characterization

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Matching of bigraphs
• Axiomatizing binding bigraphs
• Induced matchings in bipartite graphs
• Representation of large matchings in bipartite graphs
• Induced Matching in Some Subclasses of Bipartite Graphs
• Matching for Graphs of Bounded Degree
• Induced matchings in graphs of bounded maximum degree
• Binding number, toughness and general matching extendability in graphs
• Some Results on Matching in Bipartite Graphs
• On maximum induced matchings in bipartite graphs

Cites work

• scientific article; zbMATH DE number 1820633 (Why is no real title available?)
• An Algorithm for Subgraph Isomorphism
• Axiomatizing binding bigraphs
• Axioms for bigraphical structure
• Constraint satisfaction algorithms for graph pattern matching
• Directed Graph Pattern Matching and Topological Embedding
• Faster Subtree Isomorphism
• Foundations of Software Science and Computation Structures
• Fundamentals of algebraic graph transformation
• Matching of bigraphs
• Pure bigraphs: structure and dynamics
• Sortings for Reactive Systems
• The Space and Motion of Communicating Agents
• The tree-to-tree editing problem
• Transition systems, link graphs and Petri nets

Cited in

(4)

• Executing bigraphical reactive systems
• Finding a forest in a tree
• Computing embeddings of directed bigraphs
• Matching of bigraphs

This page was built for publication: An inductive characterization of matching in binding bigraphs

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