"A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph."

Vida Dujmovic et al. (2013)

> Home

Details and statistics

DOI: 10.1137/120866725

access: closed

type: Journal Article

metadata version: 2020-04-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamdm/DujmovicHJRW13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/DujmovicHJRW13
Vida Dujmovic, Daniel J. Harvey, Gwenaël Joret, Bruce A. Reed, David R. Wood:
A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph. SIAM J. Discret. Math. 27(4): 1770-1774 (2013)

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.