Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Heuristic to reduce the complexity of complete bipartite graphs to ..."

Daniel Etzold (2003)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2020-01-10

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/cs-DS-0306123
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/cs-DS-0306123
Daniel Etzold:
Heuristic to reduce the complexity of complete bipartite graphs to accelerate the search for maximum weighted matchings with small error. CoRR cs.DS/0306123 (2003)

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.