"Maximal Matching and Path Matching Counting in Polynomial Time for Graphs ..."

Benjamin Hellouin de Menibus, Takeaki Uno (2011)

> Home

Details and statistics

DOI: 10.1007/978-3-642-20877-5_47

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/tamc/MenibusU11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/tamc/MenibusU11
Benjamin Hellouin de Menibus, Takeaki Uno:
Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width. TAMC 2011: 483-494

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.