Finding small dijoins in transitive closure time

DOI10.4230/LIPICS.FSTTCS.2025.46MaRDI QIDQ7391927zbMATH OpenFDO

Authors Chaitanya Nalam, Thatchaphol Saranurak

Publication date 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2025.46

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cites work

• A Minimax Theorem for Directed Graphs
• An algorithm for minimum cost arc-connectivity orientations
• An application of submodular flows
• Centroids, Representations, and Submodular Flows
• Complexity of (arc)-connectivity problems involving arc-reversals or deorientations
• Finding feasible vectors of Edmonds-Giles polyhedra
• Generalized polymatroids and submodular flows
• How to make a digraph strongly connected
• scientific article; zbMATH DE number 437545 (Why is no real title available?)
• scientific article; zbMATH DE number 3167398 (Why is no real title available?)
• scientific article; zbMATH DE number 3862930 (Why is no real title available?)
• scientific article; zbMATH DE number 2246594 (Why is no real title available?)
• Improved algorithms for submodular function minimization and submodular flow
• Minimization on submodular flows
• Packing rooted directed cuts in a weighted directed graph
• Simple push-relabel algorithms for matroids and submodular flows
• Strong Covering of a Bipartite Graph

This page was built for publication: Finding small dijoins in transitive closure time

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