"Finding large cliques in arbitrary graphs by bipartite matching."

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

Egon Balas, William Niehaus (1993)

> Home

Details and statistics

DOI: 10.1090/DIMACS/026/03

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/BalasN93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dimacs/BalasN93
Egon Balas, William Niehaus:
Finding large cliques in arbitrary graphs by bipartite matching. Cliques, Coloring, and Satisfiability 1993: 29-51

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.