Maximum cardinality search for computing minimal triangulations of graphs (Q1882406): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-004-1084-3 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-004-1084-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2067692416 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-004-1084-3 / rank | |||
Normal rank | |||
Latest revision as of 11:20, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum cardinality search for computing minimal triangulations of graphs |
scientific article |
Statements
Maximum cardinality search for computing minimal triangulations of graphs (English)
0 references
1 October 2004
0 references
chordal graphs
0 references
