Finding paths in graphs avoiding forbidden transitions (Q1861577): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:30, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding paths in graphs avoiding forbidden transitions |
scientific article |
Statements
Finding paths in graphs avoiding forbidden transitions (English)
0 references
9 March 2003
0 references
compatible path
0 references
transition
0 references
edge-colored graph
0 references
forbidden pairs
0 references
NP-completeness
0 references
linear time algorithm
0 references
transition graph
0 references
transition systems
0 references
