Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

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

Benjamin Hellouin de Menibus, Takeaki Uno (2018)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2018-08-13

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-1806-00791
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1806-00791
Benjamin Hellouin de Menibus, Takeaki Uno:
Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width. CoRR abs/1806.00791 (2018)

a service of

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.