Work

A Fully Combinatorial Algorithm for Submodular Function Minimization

Year: 2002

Type: article

Source: Journal of Combinatorial Theory Series B

DOI: 10.1006/jctb.2001.2072

Author: Satoru Iwata

Institution: The University of Tokyo

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W2561008772

FWCI: 4.746

Cites: 21

Cited by: 60

Related to: 10