DOI10.1002/net.3230120206zbMath0485.90081OpenAlexW2042803872WikidataQ126263612 ScholiaQ126263612MaRDI QIDQ3945965
Maurice Queyranne, Jean-Claude Picard
Publication date: 1982
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230120206
A linear-time algorithm for finding a minimum spanning pseudoforest,
Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems,
On the efficiency of maximum-flow algorithms on networks with small integer capacities,
Fractional 0-1 programming: applications and algorithms,
A parametric maximum flow algorithm for bipartite graphs with applications,
Simple planar graph partition into three forests,
In search of dense subgraphs: How good is greedy peeling?,
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition,
Three ways to cover a graph,
A Fourth bibliography of fractional programming,
Second-order properties of undirected graphs,
Bounds and algorithms for graph trusses,
Edge-intersection graphs of grid paths: the bend-number,
Gap-Planar Graphs,
A Constructive Arboricity Approximation Scheme,
Decomposing a graph into pseudoforests with one having bounded degree,
Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs,
Forests, frames, and games: Algorithms for matroid sums and applications,
On the planar split thickness of graphs,
In search of the densest subgraph,
Coloring the edges of a random graph without a monochromatic giant component,
Decomposing a graph into forests: the nine dragon tree conjecture is true,
Gap-planar graphs,
Transforming a graph into a 1-balanced graph,
The equitable dispersion problem,
Minor-obstructions for apex sub-unicyclic graphs,
\(w\)-density and \(w\)-balanced property of weighted graphs,
Computing the \(k\) densest subgraphs of a graph,
Feature selection for consistent biclustering via fractional 0-1 programming,
On some algorithmic aspects of hypergraphic matroids,
On monoid graphs,
A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering,
The maximum ratio clique problem
