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