More Web Proxy on the site http://driver.im/

default search action

combined dblp search
author search
venue search
publication search

ask others

"Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs."

Marc Demange, Tínaz Ekim (2008)

> Home

Details and statistics

DOI: 10.1007/978-3-540-79228-4_32

access: closed

type: Conference or Workshop Paper

metadata version: 2020-04-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/tamc/DemangeE08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/tamc/DemangeE08
Marc Demange, Tínaz Ekim:
Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs. TAMC 2008: 364-374

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.