Towards compositional graph theory

DOI10.1016/j.entcs.2015.12.009zbMath1352.05084OpenAlexW2199829433WikidataQ113317732 ScholiaQ113317732MaRDI QIDQ5971395

Apiwat Chantawibul, Paweł Sobociński

Publication date: 16 December 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2015.12.009

zbMATH Keywords

widthmodular decompositiongraph decompositionsimple graphsrank widthcup-matrices

Mathematics Subject Classification ID

Related Items (3)

Monoidal Width ⋮ Monoidal Width: Capturing Rank Width ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bicategories of processes
• Towards an algebraic theory of Boolean circuits.
• Approximating clique-width and branch-width
• Full Abstraction for Signal Flow Graphs
• Nets, Relations and Linking Diagrams
• Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width
• A Categorical Semantics of Signal Flow Graphs
• Compositional Reachability in Petri Nets
• Interacting Quantum Observables
• Representations of Petri Net Interactions
• The Algebra of Directed Acyclic Graphs
• Diagrammatic Reasoning for Delay-Insensitive Asynchronous Circuits
• Interacting Bialgebras Are Frobenius
• A graphical approach to measurement-based quantum computing
• Categorical algebra

This page was built for publication: Towards compositional graph theory