Covering a graph with minimal local sets
From MaRDI portal
Cites work
- A generalization of the fast LUP matrix decomposition algorithm and applications
- Approximating clique-width and branch-width
- Bounds on absolutely maximally entangled states from shadow inequalities, and the quantum MacWilliams identity
- Circle graph obstructions
- Digraph Decompositions and Eulerian Systems
- Extended measurement calculus
- Graph states and the necessity of Euler decomposition
- Graph states for quantum secret sharing
- scientific article; zbMATH DE number 5666686 (Why is no real title available?)
- scientific article; zbMATH DE number 15493 (Why is no real title available?)
- scientific article; zbMATH DE number 3257167 (Why is no real title available?)
- Interacting quantum observables: categorical algebra and diagrammatics
- Local complementation and interlacement graphs
- Local unitary versus local Clifford equivalence of stabilizer states
- Nonbinary Stabilizer Codes Over Finite Fields
- On the minimum degree up to local complementation: bounds and complexity
- Pivoting makes the \textsc{zx}-calculus complete for real stabilizers
- Rank-width and vertex-minors
- Rank-width: algorithmic and structural results
- Recognizing locally equivalent graphs
- Resources Required for Preparing Graph States
- The rank-width of edge-coloured graphs
- Triangular Factorization and Inversion by Fast Matrix Multiplication
- Vertex-minor universal graphs for generating entangled quantum subsystems
- Vertex-minors of graphs: a survey
- Which Graph States are Useful for Quantum Information Processing?
This page was built for publication: Covering a graph with minimal local sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988723)
