scientific article; zbMATH DE number 780788
From MaRDI portal
Publication:4840778
zbMath0828.05001MaRDI QIDQ4840778
Publication date: 11 December 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
perfect graphsgraph entropysubadditivitysurvey articleformula complexitysorting algorithmsgraph capacity
Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial optimization (90C27) Structural characterization of families of graphs (05C75) Measures of information, entropy (94A17)
Related Items (28)
Irregular polyomino tiling via integer programming with application in phased array antenna design ⋮ Information theoretic parameters of noncommutative graphs and convex corners ⋮ Computational analysis of topological index-based entropies of carbon nanotube \(Y\)-junctions ⋮ Fast algorithms for indices of nested split graphs approximating real complex networks ⋮ Generalizing Körner's graph entropy to graphons ⋮ Entropy and the complexity of graphs revisited ⋮ A history of graph entropy measures ⋮ Entropy of symmetric graphs ⋮ Sorting under partial information (without the ellipsoid algorithm). ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory ⋮ Symmetric graphs with respect to graph entropy ⋮ Inequalities for entropy-based measures of network information content ⋮ Minimum Entropy Combinatorial Optimization Problems ⋮ Minimum entropy combinatorial optimization problems ⋮ Some new bounds of weighted graph entropies with GA and Gaurava indices edge weights ⋮ A better bound for locally thin set families ⋮ Poset entropy versus number of linear extensions: the width-2 case. ⋮ A generalization of the Bollobás set pairs inequality ⋮ Communication Lower Bounds Via the Chromatic Number ⋮ Unnamed Item ⋮ Preprocessing Ambiguous Imprecise Points ⋮ Extremality of graph entropy based on degrees of uniform hypergraphs with few edges ⋮ Probabilistic refinement of the asymptotic spectrum of graphs ⋮ Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth ⋮ The effect of graph operations on the degree-based entropy ⋮ Classical symmetries and the quantum approximate optimization algorithm ⋮ Possibilistic information theory: A coding theoretic approach
This page was built for publication:
