Graph searching, elimination trees, and a generalization of bandwidth (Q1763148)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graph searching, elimination trees, and a generalization of bandwidth |
scientific article; zbMATH DE number 2135858
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph searching, elimination trees, and a generalization of bandwidth |
scientific article; zbMATH DE number 2135858 |
Statements
Graph searching, elimination trees, and a generalization of bandwidth (English)
0 references
21 February 2005
0 references
Bandwidth
0 references
Graph searching
0 references
Elimination tree
0 references
Tree decomposition
0 references
Chordal graph
0 references
0.98943030834198
0 references
0.808863639831543
0 references
0.7636814117431641
0 references
0.7562627792358398
0 references
