Average degree in the interval graph of a random Boolean function
From MaRDI portal
Publication:2969112
zbMATH Open1389.05114MaRDI QIDQ2969112FDOQ2969112
Authors: E. Toman, Daniel Olejár, Martin Stanek
Publication date: 14 March 2017
Recommendations
Graph representations (geometric and intersection representations, etc.) (05C62) Boolean functions (06E30)
Cited In (5)
- Computing the weighted isolated scattering number of interval graphs in polynomial time
- Title not available (Why is that?)
- The number of monotone and self-dual Boolean functions.
- Properties of the interval graph of a Boolean function
- Neighbourhood of constant order in the interval graph of a random Boolean function
This page was built for publication: Average degree in the interval graph of a random Boolean function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2969112)