Keywords: مسیر همیلتون; Hamiltonian path; Connectivity; Spanning connectivity; Bypass; Tournament;
مقالات ISI مسیر همیلتون (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: مسیر همیلتون; Hypercube; Hamiltonian path; Hamiltonian laceable; Fault tolerant;
Keywords: مسیر همیلتون; Data hiding; Hamiltonian path; Imperceptibility; Undetectability; Hiding capacity;
Keywords: مسیر همیلتون; Hamiltonian path; Hamiltonian-connected graph; Line graph;
Keywords: مسیر همیلتون; Local tournament; Semicomplete decomposition; Arc-disjoint; Hamiltonian path; Hamiltonian cycle;
Keywords: مسیر همیلتون; Disjoint path cover; Cube of graph; Hamiltonian path; Spanning tree; Unicyclic graph; Linear-time algorithm;
Keywords: مسیر همیلتون; Gray code; Hamiltonian path; Hypercube; Path partition; Disjoint path cover; Prescribed endvertices;
Keywords: مسیر همیلتون; 05C45; 05C50; Spectral radius; Hamiltonian cycle; Hamiltonian path; Minimum degree;
Keywords: مسیر همیلتون; Clustered CVRP; Metaheuristic; Hamiltonian path; Record-to-Record travel algorithm;
Keywords: مسیر همیلتون; Disjoint path cover; Strong hamiltonicity; Hamiltonian path; Prescribed edge; Cube of graph
Keywords: مسیر همیلتون; Disjoint path cover; Hypercube-like graph; Hamiltonian path; Hamiltonian cycle; RHL graph; Fault tolerance; Interconnection network
Keywords: مسیر همیلتون; Spanning tree; Subdivision; Homeomorphic; Hamiltonian path
Keywords: مسیر همیلتون; Quasi-transitive digraph; kk-quasi-transitive digraph; Hamiltonian path
Keywords: مسیر همیلتون; Hamiltonian path; Hamiltonian cycle; Middle levels graph; Kneser graph
Hamiltonian cycle and path embeddings in 3-ary n-cubes based on K1,3-structure faults
Keywords: مسیر همیلتون; Hamiltonian cycle; Hamiltonian path; Structure fault; 3-ary n-cube; Interconnection network;
On relationship between Hamiltonian path and holes in L(3,2,1)-coloring of minimum span
Keywords: مسیر همیلتون; L(3,2,1)-coloring; Hole; Hamiltonian path;
Hamiltonian paths in hypercubes with local traps
Keywords: مسیر همیلتون; Hamiltonian path; Hypercube; Fault tolerance;
A linear-time algorithm for finding Hamiltonian (s,t)-paths in even-sized rectangular grid graphs with a rectangular hole
Keywords: مسیر همیلتون; Grid graph; Hamiltonian path; Hamiltonian cycle; Rectangular grid graphs with a rectangular hole; NP-complete;
An efficient algorithm to construct disjoint path covers of DCell networks
Keywords: مسیر همیلتون; Data center network; DCell network; Disjoint path cover; Hamiltonian path
Hamiltonian paths in L-shaped grid graphs
Keywords: مسیر همیلتون; Grid graph; Hamiltonian path; L-shaped grid graph; NP-complete
A note on Hamiltonian paths and cycles with prescribed edges in the 3-ary n-cube
Keywords: مسیر همیلتون; Parallel system; Interconnection network; 3-Ary n-cube; Hamiltonian path; Hamiltonian cycle
On characterizing radio kk-coloring problem by path covering problem
Keywords: مسیر همیلتون; Radio kk-coloring; Hamiltonian path; Path covering number; Circulant graph
UNO is hard, even for a single player
Keywords: مسیر همیلتون; Algorithmic combinatorial game theory; Dynamic programming; Hamiltonian path; Mathematical puzzles/games
A new result on the problem of Buratti, Horak and Rosa
Keywords: مسیر همیلتون; Hamiltonian path; Complete graph; Edge-length;
Hamiltonian path embeddings in conditional faulty k-ary n-cubes
Keywords: مسیر همیلتون; Interconnection network; Path embedding; Hamiltonian path; Conditional edge fault; k-Ary n-cube
A new light-based solution to the Hamiltonian path problem
Keywords: مسیر همیلتون; Unconventional computing; Optical computing; Light-based computing; Hamiltonian path; NP-complete problem;
Paired many-to-many disjoint path covers of the hypercubes
Keywords: مسیر همیلتون; Hypercube; Hamiltonian path; Disjoint paths; Many-to-many disjoint path cover; Interconnection networks
Hamiltonian properties of honeycomb meshes
Keywords: مسیر همیلتون; NoC; Honeycomb mesh; Hamiltonian path
Two-way incremental seriation in the temporal domain with three-dimensional visualization: Making sense of evolving high-dimensional datasets
Keywords: مسیر همیلتون; Two-way seriation; Gaussian filtering; Landscape visualization; High-dimensional data; Hamiltonian path
Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
Keywords: مسیر همیلتون; Disjoint path; Strongly Hamiltonian-laceable; Hamiltonian path; Bipartite HL-graph; Graph theory; Fault tolerance
The 2-path-bipanconnectivity of hypercubes
Keywords: مسیر همیلتون; Hypercube; Hamiltonian path; Panconnectivity; k-Path-panconnectivity; k-Disjoint path cover; Interconnection network
On the mutually independent Hamiltonian cycles in faulty hypercubes
Keywords: مسیر همیلتون; Hypercube; Hamiltonian path; Hamiltonian cycle; Faulty edge; Interconnection network
Hamiltonian connectivity of restricted hypercube-like networks under the conditional fault model
Keywords: مسیر همیلتون; Interconnection networks; Fault tolerance; Hypercube-like network; Hamiltonian path; Near-hamiltonian path; Conditional fault model
An empirical study of tests for uniformity in multidimensional data
Keywords: مسیر همیلتون; Minimum spanning tree; Hamiltonian path; Discrepancies; Spacings; KK-function
Spanning trees with specified differences in Cayley graphs
Keywords: مسیر همیلتون; Cayley graph; Spanning tree; Hamiltonian path; Labeled matroid; Edge-labeled tree
Paired many-to-many disjoint path covers of hypercubes with faulty edges
Keywords: مسیر همیلتون; Hypercube; Hamiltonian path; Vertex-disjoint paths; Cover; Fault tolerance; Interconnection networks
A linear-time algorithm for the longest path problem in rectangular grid graphs
Keywords: مسیر همیلتون; Hamiltonian path; Hamiltonian cycle; Grid graph; Longest path; Rectangular grid graph
Balanced generic circuits without long paths
Keywords: مسیر همیلتون; 05C38; Generic circuits; Hamiltonian path; Count matroid
Gray codes with bounded weights
Keywords: مسیر همیلتون; Gray code; Faulty vertex; Hypercube; Hamiltonian path; Hamiltonian cycle; NP-hard; Polynomial algorithm
On Hamiltonian paths in distance graphs
Keywords: مسیر همیلتون; Distance graph; Circulant graph; Hamiltonian path; Hamiltonian cycle
Simple Rules for Efficient Assembly Predict the Layout of a Packaged Viral RNA
Keywords: مسیر همیلتون; ssRNA, single-stranded RNA; cryo-EM, cryo-electron microscopy; 1-D, one-dimensionalssRNA virus; virus assembly; genome organization; cryo-EM; Hamiltonian path
Long cycles and paths in distance graphs
Keywords: مسیر همیلتون; Circulant graph; Distance graph; Connectivity; Hamiltonian cycle; Hamiltonian path
Hamilton-chain saturated hypergraphs
Keywords: مسیر همیلتون; Graph; Saturated graph; Hypergraph; Hamiltonian path; Hamiltonian cycle; Hamiltonian chain
Many-to-many disjoint paths in faulty hypercubes
Keywords: مسیر همیلتون; Hypercube; Disjoint paths; Fault-tolerance; Hamiltonian path; Parallel computing
On arc-traceable local tournaments
Keywords: مسیر همیلتون; Arc-traceable; Hamiltonian path; Local tournaments
Cubic maximal nontraceable graphs
Keywords: مسیر همیلتون; 05C38Maximal nontraceable; Maximal nonhamiltonian; Hypohamiltonian; Hamiltonian path; Hamiltonian cycle; Traceable; Nontraceable; Hamiltonian; Nonhamiltonian; Maximal hypohamiltonian
Noncrossing Hamiltonian paths in geometric graphs
Keywords: مسیر همیلتون; Geometric graph; Hamiltonian path
Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs
Keywords: مسیر همیلتون; 05C15; 05C38Claw-free; Maximal nontraceable; Longest path; Detour; Hamiltonian path; Traceable; Nontraceable
Chromatic properties of hamiltonian graphs
Keywords: مسیر همیلتون; 05C15Chromatic polynomials; Hamiltonian graph; Hamiltonian path; Zeros of chromatic polynomials
Spanning multi-paths in hypercubes
Keywords: مسیر همیلتون; 05C38; 05C45; 68Q10Hypercube; Hamiltonian path; Multi-path