Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation
Publication:714020
DOI10.1016/j.dam.2012.05.028zbMath1252.05152OpenAlexW2108601082MaRDI QIDQ714020
Stefan Porschen, Ewald Speckenmeyer, Andreas Wotzlaw
Publication date: 19 October 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.05.028
combinatorial optimizationsatisfiabilitygraph drawingcomputational biologyplanar embeddingcrossing minimizationtanglegram2-CNFlevel graphmixed Horn formula
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (6)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparing trees via crossing minimization
- Satisfiability of mixed Horn formulas
- On the linear-cost subtree-transfer distance between phylogenetic trees
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Edge crossings in drawings of bipartite graphs
- A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs
- Crossing Number is NP-Complete
- Drawing (Complete) Binary Tanglegrams
- Efficient Planarity Testing
- Drawing Binary Tanglegrams: An Experimental Evaluation
- Conflict-Driven Answer Set Enumeration
This page was built for publication: Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation