Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments."

Pierre Charbit, Stéphan Thomassé, Anders Yeo (2007)

> Home

Details and statistics

DOI: 10.1017/S0963548306007887

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cpc/CharbitTY07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cpc/CharbitTY07
Pierre Charbit, Stéphan Thomassé, Anders Yeo:
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments. Comb. Probab. Comput. 16(1): 1-4 (2007)

a service of

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.