"A branch&cut algorithm for the maximum common edge subgraph problem."

Gordana Manic, Laura Bahiense, Cid C. de Souza (2009)

> Home

Details and statistics

DOI: 10.1016/J.ENDM.2009.11.009

access: closed

type: Journal Article

metadata version: 2023-08-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/endm/ManicBS09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/ManicBS09
Gordana Manic, Laura Bahiense, Cid C. de Souza:
A branch&cut algorithm for the maximum common edge subgraph problem. Electron. Notes Discret. Math. 35: 47-52 (2009)

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.