scientific article; zbMATH DE number 780788

MaRDI QIDQ4840778zbMATH OpenFDO

Authors Gábor Simonyi

Publication date 11 December 1995

zbMATH Keywords

formula complexitygraph capacitygraph entropyperfect graphssorting algorithmssubadditivitysurvey article

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Structural characterization of families of graphs (05C75) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Measures of information, entropy (94A17)

Recommendations

• A history of graph entropy measures
• Perfect graphs and graph entropy: An updated survey
• scientific article; zbMATH DE number 7410337
• Extremality of degree-based graph entropies
• Entropy and the complexity of graphs revisited

Cited in

(41)

• Fast algorithms for indices of nested split graphs approximating real complex networks
• Possibilistic information theory: A coding theoretic approach
• Some new bounds of weighted graph entropies with GA and Gaurava indices edge weights
• A generalization of the Bollobás set pairs inequality
• Probabilistic refinement of the asymptotic spectrum of graphs
• The effect of graph operations on the degree-based entropy
• Classical symmetries and the quantum approximate optimization algorithm
• Information theoretic parameters of noncommutative graphs and convex corners
• Computational analysis of topological index-based entropies of carbon nanotube \(Y\)-junctions
• 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
• Perfect graphs and graph entropy: An updated survey
• Irregular polyomino tiling via integer programming with application in phased array antenna design
• Mathematical foundations and applications of graph entropy
• The Hosoya entropy of a graph
• Graphs that Split Entropies
• Minimum entropy combinatorial optimization problems
• scientific article; zbMATH DE number 167195 (Why is no real title available?)
• Entropy and the complexity of graphs revisited
• scientific article; zbMATH DE number 1092008 (Why is no real title available?)
• Recovering Set Systems and Graph Entropy
• Randomly colouring graphs (a combinatorial view)
• Preprocessing Ambiguous Imprecise Points
• Symmetric graphs with respect to graph entropy
• scientific article; zbMATH DE number 7204408 (Why is no real title available?)
• Exploring the limits of subadditive approaches: parallels between optimization and complexity theory
• Some applications of relative entropy in additive combinatorics
• A new entropy for hypergraphs
• A lower bound on graph entropy
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• Entropy of some models of sparse random graphs with vertex-names
• Communication Lower Bounds Via the Chromatic Number
• A better bound for locally thin set families
• Poset entropy versus number of linear extensions: the width-2 case.
• Generalizing Körner's graph entropy to graphons
• A history of graph entropy measures
• On the main distance-based entropies: the eccentricity- and Wiener-entropy
• Minimum entropy combinatorial optimization problems
• Entropy of symmetric graphs
• Information processing in complex networks: Graph entropy and information functionals
• Inequalities for entropy-based measures of network information content

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)