A dichotomy for the kernel by <i>H</i>‐walks problem in digraphs (Q4629993): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963439221 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1605.09589 / rank | |||
Normal rank | |||
Latest revision as of 20:18, 19 April 2024
scientific article; zbMATH DE number 7044648
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
