"A robust algorithm for bisecting a triconnected graph with two resource sets."

Hiroshi Nagamochi, Kengo Iwata, Toshimasa Ishii (2005)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2005.06.010

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/NagamochiII05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/NagamochiII05
Hiroshi Nagamochi, Kengo Iwata, Toshimasa Ishii:
A robust algorithm for bisecting a triconnected graph with two resource sets. Theor. Comput. Sci. 341(1-3): 364-378 (2005)

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.