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