scientific article; zbMATH DE number 3468645
From MaRDI portal
Publication:4053473
Cited in
(40)- Attempting perfect hypergraphs
- Structural information content of networks: graph entropy based on local vertex functionals
- Information processing in complex networks: Graph entropy and information functionals
- New bounds for perfect hashing via information theory
- Incremental measurement of structural entropy for dynamic graphs
- Disproving the normal graph conjecture
- Beating Fredman-Komlós for Perfect k-Hashing.
- Some bounds of weighted entropies with augmented Zagreb index edge weights
- Preprocessing Ambiguous Imprecise Points
- On generalized comparison-based sorting problems
- The structure and dynamics of networks with higher order interactions
- Common Information, Noise Stability, and Their Extensions
- Maximum values of degree-based entropies of bipartite graphs
- Capacities: From information theory to extremal set theory
- Communication Lower Bounds Via the Chromatic Number
- The entropy of weighted graphs with atomic bond connectivity edge weights
- A better bound for locally thin set families
- Energy of convex sets, shortest paths, and resistance
- Intersection number and capacities of graphs
- Information theoretic parameters of noncommutative graphs and convex corners
- New bounds for perfect \(k\)-hashing
- On the extremal combinatorics of the Hamming space
- scientific article; zbMATH DE number 7204408 (Why is no real title available?)
- On the distance based graph entropies
- Entropy of symmetric graphs
- Flow Complexity: Fast Polytopal Graph Complexity and 3D Object Clustering
- Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth
- Degree-based entropies of networks revisited
- A history of graph entropy measures
- Network entropies based on independent sets and matchings
- Beating Fredman-Komlós for perfect \(k\)-hashing
- Generalizing Körner's graph entropy to graphons
- Recursive bounds for perfect hashing
- Symmetric graphs with respect to graph entropy
- Bounds for degree-based network entropies
- Fredman–Komlós bounds and information theory
- Extremality of graph entropy based on degrees of uniform hypergraphs with few edges
- Fast depth-based subgraph kernels for unattributed graphs
- Probabilistic refinement of the asymptotic spectrum of graphs
- Graph information ratio
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4053473)
