"Counting Maximum Matchings in Planar Graphs Is Hard."

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

> Home

Details and statistics

DOI: —

access: open

type: Withdrawn Item

metadata version: 2021-04-01

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-2001-01493
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2001-01493
(Withdrawn) Counting Maximum Matchings in Planar Graphs Is Hard. CoRR abs/2001.01493 (2020)

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.