T-joins in strongly connected hypergraphs

DOI10.1142/S1793830917500689zbMath1386.05123OpenAlexW2759081735MaRDI QIDQ4597952

Gruia Călinescu

Publication date: 14 December 2017

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830917500689

zbMATH Keywords

T-joinweighted hypergraphstrongly connecteddirected hypergraphT-cut

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Unnamed Item
• On the orientation of graphs and hypergraphs
• Power consumption in packet radio networks
• An 11/6-approximation algorithm for the network Steiner problem
• Min-Power Strong Connectivity
• Thek-Steiner Ratio in Graphs
• Matching, Euler tours and the Chinese postman

This page was built for publication: T-joins in strongly connected hypergraphs