Results 61 to 70 of about 1,157,729 (290)

Solving a Hamiltonian Path Problem with a bacterial computer

Journal of Biological Engineering, 2009
Background The Hamiltonian Path Problem asks whether there is a route in a directed graph from a beginning node to an ending node, visiting each node exactly once. The Hamiltonian Path Problem is NP complete, achieving surprising computational complexity
Treece Jessica, Shoecraft Amber, Ritter Michelle, Morton Nickolaus, Martens Andrew T, Heard Lane, Dickson James O, DeLoache Will, Crowley Samuel, Adefuye Oyinade, Acker Karen, Baumgardner Jordan, Unzicker Matthew, Valencia Amanda, Waters Mike, Campbell A Malcolm, Heyer Laurie J, Poet Jeffrey L, Eckdahl Todd T   +18 more
doaj   +1 more source

Chromatic Roots and Hamiltonian Paths

Journal of Combinatorial Theory, Series B, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Optimal Control Drives Ultrafast and Energy‐Efficient Magnetization Switching in Van der Waals Magnets

Advanced Materials, EarlyView.
ABSTRACT The accelerating expansion of data‐centric technologies is sharply increasing the energy burden of information storage, placing unprecedented pressure on the efficiency of magnetic switching. Conventional field‐driven reversal, once the foundation of magnetic memory, has become impractical in modern architectures due to its high energy cost ...
Mohammad H. Badarneh, PeiYu Cai, Elton J. G. Santos   +2 more
wiley   +1 more source

Data Structures and their Planar Graph Layouts

Journal of Graph Algorithms and Applications, 2018
In a stack layout, also known as book embedding, the vertices of a graph are placed on a line and an edge is a data item that is pushed on the stack at the left vertex and removed at the right vertex.
Christopher Auer, Christian Bachmaier, Franz Brandenburg, Wolfgang Brunner, Andreas Gleißner   +4 more
doaj   +1 more source

Emergent Spin Supersolids in Frustrated Quantum Materials

Advanced Materials, EarlyView.
This review highlights developments in the study of spin super‐solids in frustrated quantum materials. Advanced experimental characterizations and computational studies enable a comprehensive understanding of the driving mechanisms of spin super‐solidity in various layered transition‐metal compounds, bridging materials, experiments, and theory aspects.
Yixuan Huang, Seiji Yunoki, Sadamichi Maekawa   +2 more
wiley   +1 more source

Path Independence in Adiabatic Quantum Computing for Hadamard Gate

Journal of Mathematical and Fundamental Sciences, 2014
The computation time in adiabatic quantum computing (AQC) is determined by the time limit of the adiabatic evolution, which in turn depends on the evolution path. In this research we have used the variational method to find an optimized path.
Jusak Sali Kosasih, Suhadi, Freddy Permana Zen   +2 more
doaj   +1 more source

Graphs with many hamiltonian paths

Involve, a Journal of Mathematics
A graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian path, and it is \emph{hamiltonian} if it contains a hamiltonian cycle. We construct families of non-hamiltonian graphs for which the ratio of pairs of vertices connected by hamiltonian paths to all pairs of vertices approaches 1. We then consider minimal
Carlson, Erik, Fletcher, Willem, Montee, MurphyKate, Nguyen, Chi, Renders, Jarne, Zhang, Xingyi   +5 more
openaire   +3 more sources

On Hamiltonian paths in distance graphs

Applied Mathematics Letters, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christian Löwenstein, Dieter Rautenbach, Friedrich Regen   +2 more
openaire   +1 more source

Proper Hamiltonian Paths in Edge-Coloured Multigraphs [PDF]

Graphs and Combinatorics, 2011
Given a $c$-edge-coloured multigraph, a proper Hamiltonian path is a path that contains all the vertices of the multigraph such that no two adjacent edges have the same colour. In this work we establish sufficient conditions for an edge-coloured multigraph to guarantee the existence of a proper Hamiltonian path, involving various parameters as the ...
Raquel Águeda, Valentin Borozan, Marina Groshaus, Yannis Manoussakis, Gervais Mendy, Leandro Montero   +5 more
openaire   +8 more sources

Equivariant singularity theory with distinguished parameters: Two case studies of resonant Hamiltonian systems [PDF]

, 1998
We consider Hamiltonian systems near equilibrium that can be (formally) reduced to one degree of freedom. Spatio-temporal symmetries play a key role. The planar reduction is studied by equivariant singularity theory with distinguished parameters.
Vegter, G, Lunter, Gerard, Lunter, G.A; id_orcid, Vegter, G., G. A. Lunter, Vegter, G.,, Broer, H.W., Vegter, G.; id_orcid, Broer, H.W.,, Broer, H.W.; id_orcid, Lunter, G.A, Lunter, GA, H. W. Broer, G. Vegter, Lunter, G.A.,, Broer, HW   +15 more
core   +1 more source