Monoidal Width: Capturing Rank Width
From MaRDI portal
Publication:6150162
DOI10.4204/eptcs.380.16arXiv2205.08916MaRDI QIDQ6150162
Elena di Lavore, Paweł Sobociński
Publication date: 5 March 2024
Published in: Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.08916
Cites Work
- Unnamed Item
- A well-quasi-order for tournaments
- Graph minors. I. Excluding a forest
- The geometry of tensor calculus. I
- Graph minors. X: Obstructions to tree-decomposition
- S-functions for graphs
- Graph complexity
- Upper bounds to the clique width of graphs
- A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics
- Approximating clique-width and branch-width
- On non-serial dynamic programming
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Picturing Quantum Processes
- A Survey of Graphical Languages for Monoidal Categories
- Full Rank Factorization of Matrices
- Graph minors. II. Algorithmic aspects of tree-width
- Graph expressions and graph rewritings
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- An algebraic theory of graph reduction
- Diagrammatic Semantics for Digital Circuits.
- Compositional Game Theory
- Optimal Linear Ordering
- Disintegration and Bayesian inversion via string diagrams
- Categorical algebra
- Towards compositional graph theory
