Comparing Trees Via Crossing Minimization
Authors:
- 1 January 2005
- book chapter
- Published by Springer Nature
- p. 457-469
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A survey on tree edit distance and related problemsTheoretical Computer Science, 2005
- Fast optimal leaf ordering for hierarchical clusteringBioinformatics, 2001
- Optimal Upward Planarity Testing of Single-Source DigraphsSIAM Journal on Computing, 1998
- Alignment of trees — an alternative to tree editTheoretical Computer Science, 1995
- Ordered and Unordered Tree InclusionSIAM Journal on Computing, 1995
- Drawing graphs in two layersTheoretical Computer Science, 1994
- Edge crossings in drawings of bipartite graphsAlgorithmica, 1994
- Nonlinear pattern matching in treesJournal of the ACM, 1992
- Simple Fast Algorithms for the Editing Distance between Trees and Related ProblemsSIAM Journal on Computing, 1989
- The Robertson-Seymour theorems: a survey of applications1989