DNA origami and the complexity of Eulerian circuits with turning costs (Q2003481): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal A-trails of 4-regular graphs embedded in surfaces of low genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and outerplanar conditions for \(A\)-trails in plane Eulerian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Covering Tours with Turn Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On non-intersecting Eulerian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of a new heuristic for the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc Routing Problems, Part I: The Chinese Postman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs on Surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eulerian graphs and related topics. Part 1, Volume 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eulerian graphs and related topics. Part 1, Volume 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Eulerian and Hamiltonian Graphs and Line Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On existence of reporter strands in DNA-based graph structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3926612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees, Euler tours, medial graphs, left-right paths and cycle spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plane graphs with Eulerian Petrie walks / rank
 
Normal rank

Revision as of 19:25, 19 July 2024

scientific article
Language Label Description Also known as
English
DNA origami and the complexity of Eulerian circuits with turning costs
scientific article

    Statements

    DNA origami and the complexity of Eulerian circuits with turning costs (English)
    0 references
    0 references
    0 references
    0 references
    8 July 2019
    0 references
    DNA origami
    0 references
    DNA self-assembly
    0 references
    turning cost
    0 references
    Eulerian circuit
    0 references
    Hamiltonian cycle
    0 references
    threading strand
    0 references
    biomolecular computing
    0 references
    mill routing
    0 references
    computational complexity
    0 references
    A-trails
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references