Complexity and algorithms for isometric path cover on chordal graphs and beyond (Q6602428)
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: Complexity and algorithms for isometric path cover on chordal graphs and beyond |
scientific article; zbMATH DE number 7911078
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and algorithms for isometric path cover on chordal graphs and beyond |
scientific article; zbMATH DE number 7911078 |
Statements
Complexity and algorithms for isometric path cover on chordal graphs and beyond (English)
0 references
11 September 2024
0 references
shortest paths
0 references
isometric path cover
0 references
chordal graph
0 references
interval graph
0 references
at-free graph
0 references
approximation algorithm
0 references
FPT algorithm
0 references
treewidth
0 references
chordality
0 references
treelength
0 references
