Pages that link to "Item:Q3945965"
From MaRDI portal
The following pages link to A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory (Q3945965):
Displaying 33 items.
- Decomposing a graph into pseudoforests with one having bounded degree (Q490985) (← links)
- Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs (Q492813) (← links)
- Decomposing a graph into forests: the nine dragon tree conjecture is true (Q722313) (← links)
- Minor-obstructions for apex sub-unicyclic graphs (Q777436) (← links)
- Three ways to cover a graph (Q898135) (← links)
- Transforming a graph into a 1-balanced graph (Q1003673) (← links)
- The equitable dispersion problem (Q1011261) (← links)
- A linear-time algorithm for finding a minimum spanning pseudoforest (Q1098629) (← links)
- On the efficiency of maximum-flow algorithms on networks with small integer capacities (Q1111460) (← links)
- A parametric maximum flow algorithm for bipartite graphs with applications (Q1129980) (← links)
- Forests, frames, and games: Algorithms for matroid sums and applications (Q1186784) (← links)
- Simple planar graph partition into three forests (Q1392570) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- On the planar split thickness of graphs (Q1742373) (← links)
- Gap-planar graphs (Q1786592) (← links)
- \(w\)-density and \(w\)-balanced property of weighted graphs (Q1847635) (← links)
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems (Q1904710) (← links)
- In search of the densest subgraph (Q2005555) (← links)
- Computing the \(k\) densest subgraphs of a graph (Q2094387) (← links)
- On some algorithmic aspects of hypergraphic matroids (Q2099466) (← links)
- On monoid graphs (Q2112028) (← links)
- The maximum ratio clique problem (Q2356159) (← links)
- Edge-intersection graphs of grid paths: the bend-number (Q2440108) (← links)
- Feature selection for consistent biclustering via fractional 0-1 programming (Q2576438) (← links)
- Second-order properties of undirected graphs (Q2695354) (← links)
- A Constructive Arboricity Approximation Scheme (Q3297754) (← links)
- A Fourth bibliography of fractional programming (Q4327876) (← links)
- Gap-Planar Graphs (Q4625141) (← links)
- Bounds and algorithms for graph trusses (Q5119376) (← links)
- A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering (Q5270613) (← links)
- Coloring the edges of a random graph without a monochromatic giant component (Q5891230) (← links)
- In search of dense subgraphs: How good is greedy peeling? (Q6087137) (← links)
- On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462) (← links)
