"The Complexity of Finding Subgraphs Whose Matching Number Equals the ..."

Sounaka Mishra et al. (2007)

> Home

Details and statistics

DOI: 10.1007/978-3-540-77120-3_25

access: closed

type: Conference or Workshop Paper

metadata version: 2023-02-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isaac/MishraRSSS07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/MishraRSSS07
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian:
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number. ISAAC 2007: 268-279

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.