Submodular functions and rooted trees
DOI10.1007/S00224-022-10092-XzbMATH Open1504.05206OpenAlexW4288489074MaRDI QIDQ2095463FDOQ2095463
Authors: Yaokun Wu, Yinfeng Zhu 
Publication date: 16 November 2022
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-022-10092-x
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorics of partially ordered sets (06A07)
Cites Work
- Discrete Convex Analysis
- Cores of convex games
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Generic Chaining
- A characterization of perfect graphs
- Title not available (Why is that?)
- The size Ramsey number of a directed path
- Title not available (Why is that?)
- Higher order Fourier analysis
- History of Banach Spaces and Linear Operators
- Title not available (Why is that?)
- A Dual of Dilworth's Decomposition Theorem
- Finitely Additive Measures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cores of exact games. I
- Theory of capacities
- Title not available (Why is that?)
- Wurzelbäume und unendliche Wege in Graphen
- A decomposition theorem for partially ordered sets
- Title not available (Why is that?)
- Nombre chromatique et plus longs chemins d'un graphe
- Set functions, games and capacities in decision making
- Uncertainty relation for multidimensional discrete signals
- Title not available (Why is that?)
- The concept of duality in convex analysis, and the characterization of the Legendre transform
- Combinatorial geometries, convex polyhedra, and Schubert cells
- Combinatorial representation and convex dimension of convex geometries
- Polymatroidal dependence structure of a set of random variables
- Trees as semilattices
- An introduction to measure theory
- A simple proof for the convexity of the Choquet integral
- Countably additive measures in cores of games
- Partial probabilistic information
- Decomposing a balanced game: a necessary and sufficient condition for the nonemptiness of the core
- Algebraic duality theorems for infinite LP problems
- A new class of convex games on \(\sigma\)-algebras and the optimal partitioning of measurable spaces
- Blocking duality for \(p\)-modulus on networks and applications
- Connectivity functions and polymatroids
- The sigma-core of convex games and the problem of measure extension
- Extreme points of a set of contents majorized by a submodular set function
- Maharam's problem
- The sigma-core of a cooperative game
- Some remarks on the discrete uncertainty principle
- Extremal problems for finite sets
- A double look at duality
- Last passage percolation on the complete graph
- Convex games with an infinite number of players and sequencing situations
- Homomorphisms and Ramsey properties of antimatroids
- A note on weighted rooted trees
- Title not available (Why is that?)
- The Erdős-Hajnal conjecture for long holes and antiholes
- Phylogenetic flexibility via Hall-type inequalities and submodularity
- Representation of lattices via set-colored posets
- Order- and graph-theoretic investigation of dimensions of finite topological spaces and Alexandroff spaces
- Gomory‐Hu trees of infinite graphs with finite total weight
- Weighted Rooted Trees: Fat or Tall?
- A new notion of convexity in digraphs with an application to Bayesian networks
- Three conjectures of Ostrander on digraph Laplacian eigenvectors
Cited In (1)
This page was built for publication: Submodular functions and rooted trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2095463)
