On the complexity of paths avoiding forbidden pairs (Q967328): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2009.03.018 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2114795697 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Mathematical Foundations of Computer Science 2003 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding paths and deleting edges in directed acyclic graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Impossible pair constrained test path generation in a program / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On paths avoding forbidden pairs of vertices in a graph / rank | |||
Normal rank | |||
Latest revision as of 19:26, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of paths avoiding forbidden pairs |
scientific article |
Statements
On the complexity of paths avoiding forbidden pairs (English)
0 references
28 April 2010
0 references
path
0 references
forbidden pairs
0 references
algorithm
0 references
