A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs (Q3007679): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing (Complete) Binary Tanglegrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linear-cost subtree-transfer distance between phylogenetic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge crossings in drawings of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing trees via crossing minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4702944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability of mixed Horn formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741531 / rank
 
Normal rank

Latest revision as of 03:51, 4 July 2024

scientific article
Language Label Description Also known as
English
A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs
scientific article

    Statements

    A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs (English)
    0 references
    0 references
    0 references
    0 references
    17 June 2011
    0 references
    satisfiability
    0 references
    mixed Horn formula
    0 references
    2-CNF
    0 references
    level graph
    0 references
    tanglegram
    0 references
    planar embedding
    0 references
    crossing minimization
    0 references
    graph drawing
    0 references

    Identifiers