A satisfiability-based approach for embedding generalized tanglegrams on level graphs

DOI10.1007/978-3-642-21581-0_12MaRDI QIDQ3007679zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

satisfiabilitycrossing minimizationgraph drawingtanglegramplanar embedding2-CNFlevel graphmixed Horn formula

Mathematics Subject Classification ID

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)

Recommendations

• Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation
• Drawing (complete) binary tanglegrams
• Drawing binary tanglegrams: an experimental evaluation
• Drawing (Complete) Binary Tanglegrams
• On trees, tanglegrams, and tangled chains

Cites work

• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• scientific article; zbMATH DE number 5485473 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1377359 (Why is no real title available?)
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• A satisfiability formulation of problems on level graphs
• Comparing trees via crossing minimization
• Crossing Number is NP-Complete
• Drawing (Complete) Binary Tanglegrams
• Edge crossings in drawings of bipartite graphs
• Efficient Planarity Testing
• On the linear-cost subtree-transfer distance between phylogenetic trees
• Satisfiability of mixed Horn formulas

Cited in

(3)

• A satisfiability formulation of problems on level graphs
• Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation
• scientific article; zbMATH DE number 3843669 (Why is no real title available?)

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)