"Approximate the Clique-Width of a Graph Using Shortest Paths."

J. Leonardo González-Ruiz et al. (2021)

> Home

Details and statistics

DOI: 10.1007/978-3-030-89820-5_27

access: closed

type: Conference or Workshop Paper

metadata version: 2023-06-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/micai/Gonzalez-RuizMH21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/micai/Gonzalez-RuizMH21
J. Leonardo González-Ruiz, José Raymundo Marcial-Romero, José Antonio Hernández Servín, Guillermo De Ita:
Approximate the Clique-Width of a Graph Using Shortest Paths. MICAI (2) 2021: 337-347

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.