"NC Algorithms for Computing a Perfect Matching, the Number of Perfect ..."

David Eppstein, Vijay V. Vazirani (2019)

> Home

Details and statistics

DOI: 10.1145/3323165.3323206

access: closed

type: Conference or Workshop Paper

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/spaa/EppsteinV19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/spaa/EppsteinV19
David Eppstein, Vijay V. Vazirani:
NC Algorithms for Computing a Perfect Matching, the Number of Perfect Matchings, and a Maximum Flow in One-Crossing-Minor-Free Graphs. SPAA 2019: 23-30

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.