"On the Complexity of Matching Cut in Graphs of Fixed Diameter."

Hoàng-Oanh Le, Van Bang Le (2016)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ISAAC.2016.50

access: open

type: Conference or Workshop Paper

metadata version: 2024-10-06

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/isaac/LeL16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/LeL16
Hoàng-Oanh Le, Van Bang Le:
On the Complexity of Matching Cut in Graphs of Fixed Diameter. ISAAC 2016: 50:1-50:12

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.