54 citations · 123 across the 39 of their papers we have counts for
4 papers · 1 filter
L-convexity on graph structures
Hiroshi Hirai
In this paper, we study classes of discrete convex functions: submodular functions on modular semilattices and L-convex functions on oriented modular graphs. They were introduced b…
A compact representation for minimizers of -submodular functions
Hiroshi Hirai, Taihei Oki
A -submodular function is a generalization of submodular and bisubmodular functions. This paper establishes a compact representation for minimizers of a -submodular function…
Computing DM-decomposition of a partitioned matrix with rank-1 blocks
Hiroshi Hirai
In this paper, we develop a polynomial time algorithm to compute a Dulmage-Mendelsohn-type decomposition of a matrix partitioned into submatrices of rank at most .
Shortest (A+B)-path packing via hafnian
Hiroshi Hirai, Hiroyuki Namba
Björklund and Husfeldt developed a randomized polynomial time algorithm to solve the shortest two disjoint paths problem. Their algorithm is based on computation of permanents modu…