Pages that link to "Item:Q1359940"
From MaRDI portal
The following pages link to Submodular functions and electrical networks (Q1359940):
Displayed 38 items.
- Realizing symmetric set functions as hypergraph cut capacity (Q284712) (← links)
- Graph cuts with interacting edge weights: examples, approximations, and algorithms (Q517305) (← links)
- Bimonotone linear inequalities and sublattices of \(\mathbb R^n\) (Q817640) (← links)
- Index minimization of differential-algebraic equations in hybrid analysis for circuit simulation (Q847824) (← links)
- A faster algorithm for computing the principal sequence of partitions of a graph (Q848839) (← links)
- Structural identifiability in low-rank matrix factorization (Q848955) (← links)
- Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141) (← links)
- The expressive power of valued constraints: Hierarchies and collapses (Q959827) (← links)
- Algebraic and topological closure conditions for classes of pseudo-Boolean functions (Q967323) (← links)
- The expressive power of binary submodular functions (Q967393) (← links)
- Transforming a graph into a 1-balanced graph (Q1003673) (← links)
- Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
- Minimizing symmetric submodular functions (Q1290631) (← links)
- The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function. (Q1410683) (← links)
- A note on the minimization of symmetric and general submodular functions (Q1410698) (← links)
- Improving graph partitions using submodular functions. (Q1410700) (← links)
- A note on optimal covering augmentation for graphic polymatroids. (Q1603399) (← links)
- Submodular learning and covering with response-dependent costs (Q1663646) (← links)
- Disjunctive analogues of submodular and supermodular pseudo-Boolean functions (Q1878401) (← links)
- A subspace approach to linear dynamical systems (Q1947119) (← links)
- On the notion of generalized minor in topological network theory and matroids (Q2250913) (← links)
- Log-supermodularity of weight functions, ordering weighted losses, and the loading monotonicity of weighted premiums (Q2276227) (← links)
- Supermodular functions and the complexity of MAX CSP (Q2387428) (← links)
- Adhesivity of polymatroids (Q2455572) (← links)
- Sublattices of product spaces: Hulls, representations and counting (Q2477376) (← links)
- Hybrid port--Hamiltonian systems: from parameterized incidence matrices to hybrid automata (Q2496810) (← links)
- Combinatorial auctions with decreasing marginal utilities (Q2506310) (← links)
- A port-Hamiltonian formulation of physical switching systems with varying constraints (Q2641780) (← links)
- A note on the implications of approximate submodularity in discrete optimization (Q2678995) (← links)
- Higher dimensional electrical circuits (Q2697709) (← links)
- On complete versions of Thevenin-Norton and maximum power transfer theorems (Q2700458) (← links)
- Theory of Principal Partitions Revisited (Q2971607) (← links)
- Recent Developments in Discrete Convex Analysis (Q2971611) (← links)
- The Expressive Power of Binary Submodular Functions (Q3182971) (← links)
- The Expressive Power of Valued Constraints: Hierarchies and Collapses (Q3523088) (← links)
- The Submodular Secretary Problem Goes Linear (Q4637502) (← links)
- Tractability index of hybrid equations for circuit simulation (Q5389439) (← links)
- Some applications of an Implicit Duality Theorem to connections of structures of special types including Dirac and reciprocal structures. (Q5958562) (← links)