Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs (Q1313714)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs |
scientific article |
Statements
Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs (English)
0 references
1994
0 references
depth-first search tree
0 references
breadth-first search tree
0 references
permutation graph
0 references
