|
|||||
|
|
Depth-first search as a combinatorial correspondence |
|
| Authors: | Ira Gessel Da-Lun Wang |
| Affiliation: | Massachusetts Institute of Technology, Cambridge, Massachusetts 02139 USA;University of Kentucky, Lexington, Kentucky 40506 USA |
| Abstract: | A depth first search algorithm is used to establish the connection between labeled connected graphs and inversions of trees. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |