Dualistic computational algebraic analyses of primal and dual minimum cost flow problems on acyclic tournament graphs

arXivmath/0206159MaRDI QIDQ6471925

Takayuki Ishizeki, Hiroshi Imai, Hiroki Nakayama

Publication date: 17 June 2002

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Directed graphs (digraphs), tournaments (05C20)

This page was built for publication: Dualistic computational algebraic analyses of primal and dual minimum cost flow problems on acyclic tournament graphs