A dichotomy for the kernel by <i>H</i>‐walks problem in digraphs (Q4629993)
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: A dichotomy for the kernel by H‐walks problem in digraphs |
scientific article; zbMATH DE number 7044648
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dichotomy for the kernel by <i>H</i>‐walks problem in digraphs |
scientific article; zbMATH DE number 7044648 |
Statements
A dichotomy for the kernel by <i>H</i>‐walks problem in digraphs (English)
0 references
28 March 2019
0 references
arc-colored digraph
0 references
kernel by \(H\)-walks
0 references
monochromatic path
0 references
reachability algorithms
0 references
reachability problems
0 references
0.94082505
0 references
0 references
0.91894555
0 references
0.8937967
0 references
0.88953054
0 references
0.8893287
0 references
0.8829865
0 references
0.87909615
0 references
0.87883574
0 references
