"An Optimal Algorithm for Finding Maximum Induced Bipartitie Subgraphs of ..."

Si-Qing Zheng (1992)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2002-04-15

- no documents available
- export record
  dblp key:
  - conf/icci/Zheng92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icci/Zheng92
Si-Qing Zheng:
An Optimal Algorithm for Finding Maximum Induced Bipartitie Subgraphs of Circular-Arc Graphs. ICCI 1992: 50-53

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.