Finding paths in graphs avoiding forbidden transitions (Q1861577): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0166-218x(02)00251-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2101752896 / rank | |||
Normal rank | |||
Latest revision as of 10:57, 30 July 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
