"The Effect of a Connectivity Requirement on the Complexity of Maximum ..."

Mihalis Yannakakis (1979)

> Home

Details and statistics

DOI: 10.1145/322154.322157

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/Yannakakis79
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/Yannakakis79
Mihalis Yannakakis:
The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems. J. ACM 26(4): 618-630 (1979)

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.