Polynomial-Time Algorithm for the Leafage of Chordal Graphs (Q3639254): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-04128-0_27 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2127689597 / rank | |||
Normal rank | |||
Latest revision as of 01:17, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-Time Algorithm for the Leafage of Chordal Graphs |
scientific article |
Statements
Polynomial-Time Algorithm for the Leafage of Chordal Graphs (English)
0 references
29 October 2009
0 references
chordal graph
0 references
intersection graph
0 references
collection of subtrees
0 references
host tree
0 references
tree model
0 references
leafage
0 references
polynomial time algorithm
0 references
