"A Note on the NP-Completeness of Vertex Elimination on Directed Graphs."

John R. Gilbert (1980)

> Home

Details and statistics

DOI: 10.1137/0601033

access: closed

type: Journal Article

metadata version: 2021-07-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siammax/Gilbert80a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siammax/Gilbert80a
John R. Gilbert:
A Note on the NP-Completeness of Vertex Elimination on Directed Graphs. SIAM J. Algebraic Discret. Methods 1(3): 292-294 (1980)

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.