A satisfiability-based approach for embedding generalized tanglegrams on level graphs
DOI10.1007/978-3-642-21581-0_12zbMATH Open1330.68225OpenAlexW88002070MaRDI QIDQ3007679FDOQ3007679
Authors: Ewald Speckenmeyer, Andreas Wotzlaw, Stefan Porschen 
Publication date: 17 June 2011
Published in: Theory and Applications of Satisfiability Testing - SAT 2011 (Search for Journal in Brave)
Full work available at URL: http://e-archive.informatik.uni-koeln.de/614/2/zaik2011-614.pdf
Recommendations
satisfiabilitycrossing minimizationgraph drawingtanglegramplanar embedding2-CNFlevel graphmixed Horn formula
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Problems related to evolution (92D15) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- On the linear-cost subtree-transfer distance between phylogenetic trees
- Title not available (Why is that?)
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Efficient Planarity Testing
- Crossing Number is NP-Complete
- Title not available (Why is that?)
- Title not available (Why is that?)
- Edge crossings in drawings of bipartite graphs
- Satisfiability of mixed Horn formulas
- A satisfiability formulation of problems on level graphs
- Drawing (Complete) Binary Tanglegrams
- Title not available (Why is that?)
- Comparing trees via crossing minimization
Cited In (3)
This page was built for publication: A satisfiability-based approach for embedding generalized tanglegrams on level graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3007679)
