"The maximum cardinality cut problem in co-bipartite chain graphs."

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

> Home

Details and statistics

DOI: 10.1007/S10878-015-9963-X

access: closed

type: Journal Article

metadata version: 2024-02-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/BoyaciES18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/BoyaciES18
Arman Boyaci, Tínaz Ekim, Mordechai Shalom:
The maximum cardinality cut problem in co-bipartite chain graphs. J. Comb. Optim. 35(1): 250-265 (2018)

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.