Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Maximum cuts and largest bipartite subgraphs."

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

Svatopluk Poljak, Zsolt Tuza (1993)

> Home

Details and statistics

DOI: 10.1090/DIMACS/020/04

access: closed

type: Conference or Workshop Paper

metadata version: 2022-06-09

- view
  - electronic edition via DOI (archived)
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/dimacs/PoljakT93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dimacs/PoljakT93
Svatopluk Poljak, Zsolt Tuza:
Maximum cuts and largest bipartite subgraphs. Combinatorial Optimization 1993: 181-244

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.