"How Many Pairwise Preferences Do We Need to Rank a Graph Consistently?"

Aadirupa Saha, Rakesh Shivanna, Chiranjib Bhattacharyya (2019)

> Home

Details and statistics

DOI: 10.1609/AAAI.V33I01.33014830

access: open

type: Conference or Workshop Paper

metadata version: 2021-02-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/aaai/SahaSB19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaai/SahaSB19
Aadirupa Saha, Rakesh Shivanna, Chiranjib Bhattacharyya:
How Many Pairwise Preferences Do We Need to Rank a Graph Consistently? AAAI 2019: 4830-4837

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.