Boolean dimension and dim-boundedness: Planar cover graph with a zero.
Piotr MicekHeather C. Smith BlakeWilliam T. TrotterPublished in: CoRR (2022)
Keyphrases
- planar graphs
- graph representation
- sufficient conditions
- random walk
- infrared
- structured data
- graph theory
- graph construction
- bipartite graph
- graph structure
- weighted graph
- graph theoretic
- directed acyclic graph
- boolean functions
- connected components
- spanning tree
- graph databases
- neural network
- single point
- curved surfaces
- graph search
- stable set