Finding degree-constrained acyclic orientations

DOI10.4230/LIPICS.IPEC.2023.19MaRDI QIDQ6926190zbMATH OpenFDO

Authors Jaroslav Garvardt, Malte Renken, Jannik Schestag, Mathias Weller

Publication date 24 September 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.IPEC.2023.19

zbMATH Keywords

general factorgraph orientationNP-hardnessparameterized algorithmsphylogenetic networkstreewidth

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Algorithms in computer science (68Wxx)

Cites work

• Editing graphs to satisfy degree constraints: a parameterized approach
• General factors of graphs
• scientific article; zbMATH DE number 3604926 (Why is no real title available?)
• scientific article; zbMATH DE number 3405992 (Why is no real title available?)
• Matchings with lower quotas: algorithms and complexity
• On the orientation of graphs
• The complexity of satisfiability problems
• The factorization of graphs. II
• Upper degree-constrained partial orientations

This page was built for publication: Finding degree-constrained acyclic orientations

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