Results 61 to 70 of about 350 (134)

Eulerian-Hamiltonian Duality: A Structural Unification of Graph Traversals

open access: yes
This paper introduces a theoretical framework for a structural duality between Eulerian and Hamiltonian cycles in graph theory. Historically treated as distinct problems with disparate computational complexities, we propose a novel graph transformation, the Vertex-Edge Incidence Graph (VEIG), that maps the edge-centric properties of Eulerian circuits ...
openaire   +2 more sources

Quantum computing algorithms: getting closer to critical problems in computational biology. [PDF]

open access: yesBrief Bioinform, 2022
Marchetti L   +8 more
europepmc   +1 more source

Flip Distances Between Graph Orientations. [PDF]

open access: yesAlgorithmica, 2021
Aichholzer O   +6 more
europepmc   +1 more source

Genome assembly using quantum and quantum-inspired annealing. [PDF]

open access: yesSci Rep, 2021
Boev AS   +7 more
europepmc   +1 more source

Self-Assembly, Self-Folding, and Origami: Comparative Design Principles. [PDF]

open access: yesBiomimetics (Basel), 2022
Jungck JR   +3 more
europepmc   +1 more source

Eulerian and hamiltonian graphs for the primary and secondary school classroom [PDF]

open access: yes, 2017
V magistrskem delu obravnavam izbrana poglavja iz teorije grafov in sicer Eulerjeve in Hamiltonove grafe. V prvem delu navajam potrebne definicije, trditve in izreke z dokazi. Podani so tudi osnovni pojmi, ki se navezujejo na ti dve vsebini.
Plavec, Kristina
core  

Home - About - Disclaimer - Privacy