"Computing a Minimum Cut in a Graph with Dynamic Edges Incident to a ..."

Hiroshi Nagamochi (2007)

> Home

Details and statistics

DOI: 10.1093/IETISY/E90-D.2.428

access: closed

type: Journal Article

metadata version: 2020-04-11

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ieicet/Nagamochi07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ieicet/Nagamochi07
Hiroshi Nagamochi:
Computing a Minimum Cut in a Graph with Dynamic Edges Incident to a Designated Vertex. IEICE Trans. Inf. Syst. 90-D(2): 428-431 (2007)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.