"An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs ..."

Kazuhiro Kurita et al. (2019)

> Home

Details and statistics

DOI: 10.1007/978-3-030-25005-8_28

access: closed

type: Conference or Workshop Paper

metadata version: 2019-10-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/iwoca/KuritaWUA19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwoca/KuritaWUA19
Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura:
An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. IWOCA 2019: 339-351

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.