An inductive characterization of matching in binding bigraphs
DOI10.1007/S00165-011-0184-5zbMATH Open1259.68157OpenAlexW2084135842MaRDI QIDQ1941899FDOQ1941899
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
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
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)
Cites Work
- An Algorithm for Subgraph Isomorphism
- Title not available (Why is that?)
- Pure bigraphs: structure and dynamics
- Axioms for bigraphical structure
- The Space and Motion of Communicating Agents
- Directed Graph Pattern Matching and Topological Embedding
- Constraint satisfaction algorithms for graph pattern matching
- Fundamentals of algebraic graph transformation
- The tree-to-tree editing problem
- Foundations of Software Science and Computation Structures
- Faster Subtree Isomorphism
- Transition systems, link graphs and Petri nets
- Matching of bigraphs
- Axiomatizing binding bigraphs
- Sortings for Reactive Systems
Cited In (4)
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)
