"Computing Graph Polynomials on Graphs of Bounded Clique-Width."

Johann A. Makowsky et al. (2006)

> Home

Details and statistics

DOI: 10.1007/11917496_18

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wg/MakowskyRAG06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/MakowskyRAG06
Johann A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin:
Computing Graph Polynomials on Graphs of Bounded Clique-Width. WG 2006: 191-204

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.