\(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6477673
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(k\)-chordal graphs: from cops and robber to compact routing via treewidth |
scientific article; zbMATH DE number 6477673 |
Statements
\(k\)-chordal graphs: from cops and robber to compact routing via treewidth (English)
0 references
2 September 2015
0 references
treewidth
0 references
chordality
0 references
compact routing
0 references
cops and robber games
0 references
0 references
0.9963698387145996
0 references
0.7956557273864746
0 references
0.7577131986618042
0 references
