Treewidth and minimum fill-in on permutation graphs in linear time (Q708222): 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.1016/j.tcs.2010.06.017 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2090497853 / rank | |||
Normal rank | |||
Revision as of 18:51, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Treewidth and minimum fill-in on permutation graphs in linear time |
scientific article |
Statements
Treewidth and minimum fill-in on permutation graphs in linear time (English)
0 references
11 October 2010
0 references
graph algorithms
0 references
treewidth
0 references
minimal triangulation
0 references
linear time
0 references
permutation graphs
0 references
interval graphs
0 references
