Minimizing external vertices in hypergraph orientations

DOI10.1007/978-3-031-60924-4_10MaRDI QIDQ7030729zbMATH OpenFDO

Authors Alberto José Ferrari, V. Leoni, G. Nasini, Gabriel Valiente

Publication date 7 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-60924-4_10

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Directed graphs (digraphs), tournaments (05C20) Integer programming (90C10) Hypergraphs (05C65)

Cites work

• scientific article; zbMATH DE number 1950566 (Why is no real title available?)
• Computing Eulerian trails
• Degree-constrained graph orientation: maximum satisfaction and minimum violation
• Directed hypergraphs and applications
• Matching, Euler tours and the Chinese postman
• Minimizing maximum indegree
• Node-and edge-deletion NP-complete problems
• On finding orientations with the fewest number of vertices with small out-degree
• On the orientation of graphs and hypergraphs

Cited in

(1)

• The hypergraph orientation problem with vertex constraints

This page was built for publication: Minimizing external vertices in hypergraph orientations

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