On the orientation of graphs and hypergraphs

DOI10.1016/S0166-218X(02)00462-6zbMath1030.90099MaRDI QIDQ1410690

Tamás Király, Zoltán Király, András Frank

Publication date: 14 October 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

ConnectivityOrientationDirected hypergraphUncrossing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Hypergraphs (05C65) Combinatorial optimization (90C27)

Related Items (22)

Algorithms for finding a rooted \((k,1)\)-edge-connected orientation ⋮ Reachability in arborescence packings ⋮ On vertex independence number of uniform hypergraphs ⋮ Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams ⋮ Steiner connectivity problems in hypergraphs ⋮ Fuzzy logic programs as hypergraphs. Termination results ⋮ Complexity of (arc)-connectivity problems involving arc-reversals or deorientations ⋮ Resource-sharing systems and hypergraph colorings ⋮ Series-parallel orientations preserving the cycle-radius ⋮ T-joins in strongly connected hypergraphs ⋮ A Survey on Covering Supermodular Functions ⋮ Tree-compositions and orientations ⋮ Old and new results on packing arborescences in directed hypergraphs ⋮ Directed hypergraphs: introduction and fundamental algorithms -- a survey ⋮ Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs ⋮ The parity problem of polymatroids without double circuits ⋮ A note on parity constrained orientations ⋮ The complexity of arc-colorings for directed hypergraphs ⋮ Degree-constrained orientations of embedded graphs ⋮ Packing of mixed hyperarborescences with flexible roots via matroid intersection ⋮ Decreasing minimization on M-convex sets: algorithms and applications ⋮ On some algorithmic aspects of hypergraphic matroids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the orientation of graphs
• Directed hypergraphs and applications
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• Structures of polyhedra determined by submodular functions on crossing families
• A Reduction Method for Edge-Connectivity in Graphs
• A Theorem on Graphs, with an Application to a Problem of Traffic Control

This page was built for publication: On the orientation of graphs and hypergraphs