Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation (Q714020): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Sat4j / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2012.05.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2108601082 / rank
 
Normal rank
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: 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: Conflict-Driven Answer Set Enumeration / 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: Drawing Binary Tanglegrams: An Experimental Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability of mixed Horn formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs / rank
 
Normal rank

Latest revision as of 19:42, 5 July 2024

scientific article
Language Label Description Also known as
English
Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation
scientific article

    Statements

    Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation (English)
    0 references
    0 references
    0 references
    0 references
    19 October 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    satisfiability
    0 references
    mixed Horn formula
    0 references
    2-CNF
    0 references
    level graph
    0 references
    planar embedding
    0 references
    tanglegram
    0 references
    crossing minimization
    0 references
    graph drawing
    0 references
    computational biology
    0 references
    combinatorial optimization
    0 references
    0 references
    0 references
    0 references