Pages that link to "Item:Q988574"
From MaRDI portal
The following pages link to Comparing trees via crossing minimization (Q988574):
Displaying 11 items.
- Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation (Q714020) (← links)
- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (Q2008804) (← links)
- A new non-Archimedean metric on persistent homology (Q2095728) (← links)
- An infinite antichain of planar tanglegrams (Q2140994) (← links)
- Visualizing co-phylogenetic reconciliations (Q2310765) (← links)
- Crossing Minimization in Storyline Visualization (Q2961530) (← links)
- A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs (Q3007679) (← links)
- Comparing classification tree structures: a special case of comparing q-ary relations (Q4497863) (← links)
- (Q5743380) (← links)
- Planar tanglegram layouts and single edge insertion (Q6103811) (← links)
- Characterizing planar tanglegram layouts and applications to edge insertion problems (Q6162140) (← links)