scientific article; zbMATH DE number 1101952

MaRDI QIDQ4371129zbMATH OpenFDO

Authors Christian Fremuth-Paeger

Publication date 8 January 1998

zbMATH Keywords

\(f\)-factor problemdegree constrained subgraph problemmatching algorithmsmatching problemnetwork flowpseudocode formalism

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 795216
• A new algorithm for general matching problems using network flow subproblems
• Balanced network flows. VIII. A revised theory of phase‐ordered algorithms and the O( $\bf\it\sqrt{n}m$ log(n²/m)/log n) bound for the nonbipartite cardinality matching problem
• Programming in networks and graphs. On the combinatorial background and near-equivalence of network flow and matching algorithms

Cited in

(8)

• Good characterizations for some degree constrained subgraphs
• Subdivision schemes, network flows and linear optimization
• Degree Bounded Matroids and Submodular Flows
• Degree-Constrained Subgraph Problems: Hardness and Approximation Results
• scientific article; zbMATH DE number 1769330 (Why is no real title available?)
• Balanced network flows. III. Strongly polynomial augmentation algorithms
• Balanced network flows. VIII. A revised theory of phase‐ordered algorithms and the O( $\bf\it\sqrt{n}m$ log(n²/m)/log n) bound for the nonbipartite cardinality matching problem
• Graph factors and factorization: 1985--2003: a survey

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371129)