Linear time low tree-width partitions and algorithmic consequences (Q2931403)
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: Linear time low tree-width partitions and algorithmic consequences |
scientific article; zbMATH DE number 6373912
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear time low tree-width partitions and algorithmic consequences |
scientific article; zbMATH DE number 6373912 |
Statements
Linear time low tree-width partitions and algorithmic consequences (English)
0 references
25 November 2014
0 references
bounded expansion
0 references
coloration
0 references
first-order logic
0 references
fraternal augmentation
0 references
graph minor
0 references
subgraph isomorphism
0 references
tree-width
0 references
0.9502571821212769
0 references
0.8092126250267029
0 references
0.7870083451271057
0 references
0.7795219421386719
0 references
0.7679686546325684
0 references
