scientific article; zbMATH DE number 780788
From MaRDI portal
Publication:4840778
zbMATH Open0828.05001MaRDI QIDQ4840778FDOQ4840778
Authors: Gábor Simonyi 
Publication date: 11 December 1995
Title of this publication is not available (Why is that?)
Recommendations
graph entropysubadditivityperfect graphssorting algorithmssurvey articlegraph capacityformula complexity
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Measures of information, entropy (94A17) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Structural characterization of families of graphs (05C75)
Cited In (40)
- Perfect graphs and graph entropy: An updated survey
- Classical symmetries and the quantum approximate optimization algorithm
- A lower bound on graph entropy
- Entropy and the complexity of graphs revisited
- Minimum entropy combinatorial optimization problems
- Minimum entropy combinatorial optimization problems
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Some new bounds of weighted graph entropies with GA and Gaurava indices edge weights
- Title not available (Why is that?)
- Poset entropy versus number of linear extensions: the width-2 case.
- A history of graph entropy measures
- Graphs that Split Entropies
- Irregular polyomino tiling via integer programming with application in phased array antenna design
- Information processing in complex networks: Graph entropy and information functionals
- The Hosoya entropy of a graph
- Randomly colouring graphs (a combinatorial view)
- Inequalities for entropy-based measures of network information content
- A better bound for locally thin set families
- Information theoretic parameters of noncommutative graphs and convex corners
- Computational analysis of topological index-based entropies of carbon nanotube \(Y\)-junctions
- Entropy of some models of sparse random graphs with vertex-names
- Generalizing Körner's graph entropy to graphons
- Fast algorithms for indices of nested split graphs approximating real complex networks
- Communication Lower Bounds Via the Chromatic Number
- Exploring the limits of subadditive approaches: parallels between optimization and complexity theory
- Recovering Set Systems and Graph Entropy
- A new entropy for hypergraphs
- Mathematical foundations and applications of graph entropy
- Title not available (Why is that?)
- Symmetric graphs with respect to graph entropy
- Possibilistic information theory: A coding theoretic approach
- A generalization of the Bollobás set pairs inequality
- Extremality of graph entropy based on degrees of uniform hypergraphs with few edges
- Probabilistic refinement of the asymptotic spectrum of graphs
- Title not available (Why is that?)
- Preprocessing Ambiguous Imprecise Points
- Entropy of symmetric graphs
- Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth
- Some applications of relative entropy in additive combinatorics
- The effect of graph operations on the degree-based entropy
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 Q4840778)
