"An O(n²) Algorithm for Finding the Compact Sets of a Graph."

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

Chiou-Kuo Liang (1993)

> Home

Details and statistics

DOI: 10.1007/BF01990522

access: closed

type: Journal Article

metadata version: 2021-06-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/bit/Liang93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/bit/Liang93
Chiou-Kuo Liang:
An O(n²) Algorithm for Finding the Compact Sets of a Graph. BIT 33(3): 390-395 (1993)

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.