scientific article
From MaRDI portal
Publication:4053473
zbMath0298.94022MaRDI QIDQ4053473
No author found.
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (40)
Capacities: From information theory to extremal set theory ⋮ On the extremal combinatorics of the Hamming space ⋮ Intersection number and capacities of graphs ⋮ Degree-based entropies of networks revisited ⋮ Information theoretic parameters of noncommutative graphs and convex corners ⋮ Fredman–Komlós bounds and information theory ⋮ Bounds for degree-based network entropies ⋮ Fast depth-based subgraph kernels for unattributed graphs ⋮ New bounds for perfect hashing via information theory ⋮ Attempting perfect hypergraphs ⋮ Generalizing Körner's graph entropy to graphons ⋮ A history of graph entropy measures ⋮ Entropy of symmetric graphs ⋮ Graph Information Ratio ⋮ The structure and dynamics of networks with higher order interactions ⋮ Sorting under partial information (without the ellipsoid algorithm). ⋮ New bounds for perfect \(k\)-hashing ⋮ Disproving the normal graph conjecture ⋮ The entropy of weighted graphs with atomic bond connectivity edge weights ⋮ Structural information content of networks: graph entropy based on local vertex functionals ⋮ Network entropies based on independent sets and matchings ⋮ On the distance based graph entropies ⋮ Information processing in complex networks: Graph entropy and information functionals ⋮ Maximum values of degree-based entropies of bipartite graphs ⋮ Symmetric graphs with respect to graph entropy ⋮ Some bounds of weighted entropies with augmented Zagreb index edge weights ⋮ Energy of convex sets, shortest paths, and resistance ⋮ Recursive bounds for perfect hashing ⋮ A better bound for locally thin set families ⋮ Communication Lower Bounds Via the Chromatic Number ⋮ Unnamed Item ⋮ Flow Complexity: Fast Polytopal Graph Complexity and 3D Object Clustering ⋮ Preprocessing Ambiguous Imprecise Points ⋮ Beating Fredman-Komlós for Perfect k-Hashing. ⋮ Extremality of graph entropy based on degrees of uniform hypergraphs with few edges ⋮ Probabilistic refinement of the asymptotic spectrum of graphs ⋮ Beating Fredman-Komlós for perfect \(k\)-hashing ⋮ On Generalized Comparison-Based Sorting Problems ⋮ Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth ⋮ Common Information, Noise Stability, and Their Extensions
This page was built for publication:
