"A Lower Bound for the Complexity of Monotone Graph Properties."

Robert Scheidweiler, Eberhard Triesch (2013)

> Home

Details and statistics

DOI: 10.1137/120888703

access: closed

type: Journal Article

metadata version: 2020-04-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamdm/ScheidweilerT13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/ScheidweilerT13
Robert Scheidweiler, Eberhard Triesch:
A Lower Bound for the Complexity of Monotone Graph Properties. SIAM J. Discret. Math. 27(1): 257-265 (2013)

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.