"The Computational Complexity of Feedback Vertex Set, Hamiltonian Circuit, ..."

Andreas Brandstädt (1987)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2020-03-06

- no documents available
- export record
  dblp key:
  - journals/eik/Brandstadt87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eik/Brandstadt87
Andreas Brandstädt:
The Computational Complexity of Feedback Vertex Set, Hamiltonian Circuit, Dominating Set, Steiner Tree, and Bandwidth on Special Perfect Graphs. J. Inf. Process. Cybern. 23(8/9): 471-477 (1987)

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.