"An O(n²) Divide-and-Conquer Algorithm for the Prime Tree ..."

Andrzej Ehrenfeucht et al. (1994)

> Home

Details and statistics

DOI: 10.1006/JAGM.1994.1013

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/EhrenfeuchtGMS94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/EhrenfeuchtGMS94
Andrzej Ehrenfeucht, Harold N. Gabow, Ross M. McConnell, Stephen J. Sullivan:
An O(n²) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs. J. Algorithms 16(2): 283-294 (1994)

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.