Work

Efficient Algorithms for k-Terminal Cuts on Planar Graphs

Year: 2001

Type: conference-paper

Source: Lecture notes in computer science

DOI: 10.1007/3-540-45678-3_29

Authors: Danny Z. Chen, Xiaodong Wu

Institution: University of Notre Dame

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W1699057733

FWCI:

Cites: 20

Cited by: 2

Related to: 10