"Maximum Cardinality Search for Computing Minimal Triangulations of Graphs."

Anne Berry et al. (2004)

> Home

Details and statistics

DOI: 10.1007/S00453-004-1084-3

access: closed

type: Journal Article

metadata version: 2017-06-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BerryBHP04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BerryBHP04
Anne Berry, Jean R. S. Blair, Pinar Heggernes, Barry W. Peyton:
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs. Algorithmica 39(4): 287-298 (2004)

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.