"Enumerating Graph Partitions Without Too Small Connected Components Using ..."

Yu Nakahata, Jun Kawahara, Shoji Kasahara (2018)

> Home

Details and statistics

DOI: 10.4230/LIPICS.SEA.2018.21

access: open

type: Conference or Workshop Paper

metadata version: 2020-06-15

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/wea/NakahataKK18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wea/NakahataKK18
Yu Nakahata, Jun Kawahara, Shoji Kasahara:
Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams. SEA 2018: 21:1-21:13

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.