Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs (Q1313714)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs |
scientific article; zbMATH DE number 500513
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs |
scientific article; zbMATH DE number 500513 |
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
