Perfect matching under precedence constraints

DOI10.1002/NET.70011MaRDI QIDQ6848860zbMATH OpenFDO

Authors Christina Büsing

Publication date 5 March 2026

Published in Networks (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/NET.70011

zbMATH Keywords

bounded treewidthcomplexityperfect matchingprecedence constraints

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
• An efficient genetic algorithm for the traveling salesman problem with precedence constraints
• Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem
• Complexity of Scheduling under Precedence Constraints
• Graph minors. II. Algorithmic aspects of tree-width
• Paths, Trees, and Flowers
• Primal-dual algorithms for precedence constrained covering problems
• Scheduling Tasks with AND/OR Precedence Constraints
• Scheduling with AND/OR Precedence Constraints
• The vehicle routing problem with time windows and temporal dependencies
• Treewidth. Computations and approximations

This page was built for publication: Perfect matching under precedence constraints

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