default search action

combined dblp search
author search
venue search
publication search

ask others

"The Maximum Cardinality Cut Problem is Polynomial in Proper Interval Graphs."

Arman Boyaci, Tínaz Ekim, Mordechai Shalom (2015)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2020-04-17

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/BoyaciES15a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/BoyaciES15a
Arman Boyaci, Tínaz Ekim, Mordechai Shalom:
The Maximum Cardinality Cut Problem is Polynomial in Proper Interval Graphs. CoRR abs/1512.06893 (2015)

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.