"Parallelizing an algorithm to decide if a bipartite graph is shellable."

Andrés Santamaría-Galvis et al. (2013)

> Home

Details and statistics

DOI: 10.1109/EIT.2013.6632658

access: closed

type: Conference or Workshop Paper

metadata version: 2024-05-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/eit/GalvisCBT13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eit/GalvisCBT13
Andrés Santamaría-Galvis, Roberto Cruz, John Willian Branch, Christian Trefftz:
Parallelizing an algorithm to decide if a bipartite graph is shellable. EIT 2013: 1-3

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.