"Communication Complexity of Pairs of Graph Families with Applications."

Sudeshna Kolay, Fahad Panolan, Saket Saurabh (2017)

> Home

Details and statistics

DOI: 10.4230/LIPICS.MFCS.2017.13

access: open

type: Conference or Workshop Paper

metadata version: 2019-12-27

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/mfcs/KolayP017
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/KolayP017
Sudeshna Kolay, Fahad Panolan, Saket Saurabh:
Communication Complexity of Pairs of Graph Families with Applications. MFCS 2017: 13:1-13:13

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.