Search results for "Hamiltonian-path"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
15	Yichen Yang 0007, Zhaohui Liu 0001	Approximating the multiple-depot multiple-terminal Hamiltonian path problem.	Discret. Optim.	2019	DBLP DOI BibTeX RDF
15	Gyan Singh Yadav, Aparajita Ojha	Hamiltonian path based image steganography scheme with improved imperceptibility and undetectability.	Appl. Soft Comput.	2018	DBLP DOI BibTeX RDF
15	Benjamin Momège	Connected graph G with σ2(G)≥23n and K1, 4-free contains a Hamiltonian path.	Discret. Appl. Math.	2018	DBLP DOI BibTeX RDF
15	Pazhaniappan Renjith, Narasimhan Sadagopan	Hamiltonian Path in K_1, t -free Split Graphs- A Dichotomy.	CALDAM	2018	DBLP DOI BibTeX RDF
15	Daniele Casagrande, Gianfranco Fenu, Felice Andrea Pellegrino	Hamiltonian path planning in constrained workspace.	Eur. J. Control	2017	DBLP DOI BibTeX RDF
15	P. Renjith, N. Sadagopan	Hamiltonian Path in Split Graphs- a Dichotomy.	CoRR	2017	DBLP BibTeX RDF
15	Pascal Welke	Simple Necessary Conditions for the Existence of a Hamiltonian Path with Applications to Cactus Graphs.	CoRR	2017	DBLP BibTeX RDF
15	Ushnish Sarkar, Avishek Adhikari	On relationship between Hamiltonian path and holes in -coloring of minimum span.	Discret. Appl. Math.	2017	DBLP DOI BibTeX RDF
15	Benjamin Momège	Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path.	SOFSEM	2017	DBLP DOI BibTeX RDF
15	Runtao Yang, Chengjin Zhang, Rui Gao	A new bionic method inspired by DNA computation to solve the hamiltonian path problem.	ICIA	2017	DBLP DOI BibTeX RDF
15	P. Renjith, N. Sadagopan	Hamiltonian Path in 2-Trees.	CoRR	2015	DBLP BibTeX RDF
15	Hiroyuki Hanada, Shuhei Denzumi, Yuma Inoue, Hiroshi Aoki, Norihito Yasuda, Shogo Takeuchi, Shin-ichi Minato	Enumerating Eulerian Trails via Hamiltonian Path Enumeration.	WALCOM	2015	DBLP DOI BibTeX RDF
15	Poona Bahrebar, Dirk Stroobandt	Hamiltonian Path Strategy for Deadlock-Free and Adaptive Routing in Diametrical 2D Mesh NoCs.	CCGRID	2015	DBLP DOI BibTeX RDF
15	Shiying Wang, Shurong Zhang, Yuxing Yang	Hamiltonian path embeddings in conditional faulty k-ary n-cubes.	Inf. Sci.	2014	DBLP DOI BibTeX RDF
15	L. Darrell Whitley, Francisco Chicano	Elementary Landscape Decomposition of the Hamiltonian Path Optimization Problem, .	EvoCOP	2014	DBLP DOI BibTeX RDF
15	Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl	Finding a Hamiltonian Path in a Cube with Specified Turns is Hard.	J. Inf. Process.	2013	DBLP DOI BibTeX RDF
15	Paolo Detti, Carlo Meloni, Marco Pranzo	A lower bound on the Hamiltonian path completion number of a line graph.	Appl. Math. Comput.	2013	DBLP DOI BibTeX RDF
15	Alfredo García Olaverri, Pedro Jodrá, Javier Tejel	Computing a Hamiltonian Path of Minimum Euclidean Length Inside a Simple Polygon.	Algorithmica	2013	DBLP DOI BibTeX RDF
15	Dmitriy Nuriyev	A DP Approach to Hamiltonian Path Problem	CoRR	2013	DBLP BibTeX RDF
15	Javad Salimi Sartakhti, Saeed Jalili, Ali Gholami Rudi	A new light-based solution to the Hamiltonian path problem.	Future Gener. Comput. Syst.	2013	DBLP DOI BibTeX RDF
15	Masoumeh Ebrahimi, Masoud Daneshtalab, Juha Plosila	Fault-tolerant routing algorithm for 3D NoC using Hamiltonian path strategy.	DATE	2013	DBLP DOI BibTeX RDF
15	Vincent Itier, William Puech, Jean-Pierre Pedeboy, Gilles Gesquière	Construction of a unique robust hamiltonian path for a vertex cloud.	MMSP	2013	DBLP DOI BibTeX RDF
15	Jungyun Bae, Sivakumar Rathinam	Approximation algorithms for multiple terminal, Hamiltonian path problems.	Optim. Lett.	2012	DBLP DOI BibTeX RDF
15	Blanca Isabel Niel	Every Longest Hamiltonian Path in even n-Gons.	Discret. Math. Algorithms Appl.	2012	DBLP DOI BibTeX RDF
15	Masoud Yaghini, Mohsen Momeni, Mohammadreza Sarmadi	DIMMA-Implemented Metaheuristics for Finding Shortest Hamiltonian Path Between Iranian Cities Using Sequential DOE Approach for Parameters Tuning.	Int. J. Appl. Metaheuristic Comput.	2011	DBLP DOI BibTeX RDF
15	Sai Yadlapalli, Jungyun Bae, Sivakumar Rathinam, Swaroop Darbha	Approximation algorithms for a heterogeneous Multiple Depot Hamiltonian Path Problem.	ACC	2011	DBLP DOI BibTeX RDF
15	Sunil Kumar Muttoo, Vinay Kumar	Hiding Message in Map Along Pre-Hamiltonian Path.	Int. J. Inf. Secur. Priv.	2010	DBLP DOI BibTeX RDF
15	Sivakumar Rathinam, Raja Sengupta	3/2-approximation algorithm for two variants of a 2-depot Hamiltonian path problem.	Oper. Res. Lett.	2010	DBLP DOI BibTeX RDF
15	Sakthi Balan Muthiah, Parameswaran Seshan	Incremental Building in Peptide Computing to Solve Hamiltonian Path Problem.	LATA	2010	DBLP DOI BibTeX RDF
15	João Pedro Pedroso	Metaheuristics for the Asymmetric Hamiltonian Path Problem.	NMA	2010	DBLP DOI BibTeX RDF
15	Tamara Mchedlidze, Antonios Symvonis	Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs	CoRR	2009	DBLP BibTeX RDF
15	Tamara Mchedlidze, Antonios Symvonis	Optimal Acyclic Hamiltonian Path Completion for Outerplanar Triangulated st-Digraphs (with Application to Upward Topological Book Embeddings)	CoRR	2008	DBLP BibTeX RDF
15	Yueping Li, Dingjun Lou, Yunting Lu	Algorithms For The Optimal Hamiltonian Path In Halin Graphs.	Ars Comb.	2008	DBLP BibTeX RDF
15	Mihai Oltean	A Light-Based Device for Solving the Hamiltonian Path Problem	CoRR	2007	DBLP BibTeX RDF
15	Mihai Oltean	Solving the Hamiltonian path problem with a light-based computer	CoRR	2007	DBLP BibTeX RDF
15	Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert	On the Stability of Approximation for Hamiltonian Path Problems.	Algorithmic Oper. Res.	2006	DBLP BibTeX RDF
15	Aneta Dudek, Gyula Y. Katona, A. Pawel Wojda	Hamiltonian path saturated graphs with small size.	Discret. Appl. Math.	2006	DBLP DOI BibTeX RDF
15	Israel Mark Martínez-Pérez, Gong Zhang 0005, Zoya Ignatova, Karl-Heinz Zimmermann	Biomolecular autonomous solution of the Hamiltonian path problem via hairpin formation.	Int. J. Bioinform. Res. Appl.	2005	DBLP DOI BibTeX RDF
15	Quincy Wu, Chin Lung Lu, Richard Chia-Tung Lee	The approximability of the weighted Hamiltonian path completion problem on a tree.	Theor. Comput. Sci.	2005	DBLP DOI BibTeX RDF
15	Jérôme Monnot	Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s).	Eur. J. Oper. Res.	2005	DBLP DOI BibTeX RDF
15	Clément Fredembach, Graham D. Finlayson	Hamiltonian Path based Shadow Removal.	BMVC	2005	DBLP DOI BibTeX RDF
15	Rodolfo Torres-Velázquez, Vladimir Estivill-Castro	Local search for Hamiltonian Path with applications to clustering visitation paths.	J. Oper. Res. Soc.	2004	DBLP DOI BibTeX RDF
15	Sun-Yuan Hsieh	An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs .	J. Parallel Distributed Comput.	2004	DBLP DOI BibTeX RDF
15	Lutz Volkmann, Stefan Winzen	Almost regular multipartite tournaments containing a Hamiltonian path through a given arc.	Discret. Math.	2004	DBLP DOI BibTeX RDF
15	Sang-yong Lee, Eun-Kyoung Kim, Hyo-gun Yun	DNA Computing Adopting DNA Coding Method for Hamiltonian Path Problem.	IC-AI	2003	DBLP BibTeX RDF
15	Neng-Chung Wang, Chih-Ping Chu, Tzung-Shi Chen	A dual-hamiltonian-path-based multicasting strategy for wormhole-routed star graph interconnection networks.	J. Parallel Distributed Comput.	2002	DBLP DOI BibTeX RDF
15	Gur Saran Adhar	Optimal Parallel Algorithms for Cut Vertices, Bridges, and Hamiltonian Path in Bounded Interval Tolerance Graphs.	ICPADS	2001	DBLP DOI BibTeX RDF
15	Jie Wu 0001	On Finding a Hamiltonian Path in a Tournament Using Semi-Heap.	Parallel Process. Lett.	2000	DBLP DOI BibTeX RDF
15	I. Kuban Altinel, Necati Aras, B. John Oommen	Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches.	Comput. Oper. Res.	2000	DBLP DOI BibTeX RDF
15	Frédéric Havet	Finding an Oriented Hamiltonian Path in a Tournament.	J. Algorithms	2000	DBLP DOI BibTeX RDF
15	Jørgen Bang-Jensen, Gregory Z. Gutin	On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs.	Discret. Appl. Math.	1999	DBLP DOI BibTeX RDF
15	Thomas Brunn, Bernhard Möller, Martin Russling	Layered Graph Traversals and Hamiltonian Path Problems - An Algebraic Approach.	MPC	1998	DBLP DOI BibTeX RDF
15	Nobuhiko Morimoto, Masanori Arita, Akira Suyama	Solid phase DNA solution to the Hamiltonian path problem.	DNA Based Computers	1997	DBLP DOI BibTeX RDF
15	Nobuhiko Morimoto, Masanori Arita, Akira Suyama	Stepwise Generation of Hamiltonian Path with Molecules.	BCEC	1997	DBLP BibTeX RDF
15	Muhammad H. Alsuwaiyel	Finding a Shortest Hamiltonian Path Inside a Simple Polygon.	Inf. Process. Lett.	1996	DBLP DOI BibTeX RDF
15	Rainer Feldmann, Peter Mysliwietz	The Shuffle Exchange Network has a Hamiltonian Path.	Math. Syst. Theory	1996	DBLP DOI BibTeX RDF
15	Evripidis Bampis, Pavol Hell, Yannis Manoussakis, Moshe Rosenfeld 0001	Finding an Antidirected Hamiltonian Path Starting with a Forward Arc from a Given Vertex of a Tournament.	Combinatorics and Computer Science	1995	DBLP DOI BibTeX RDF
15	Axel Conrad, Tanja Hindrichs, Hussein Morsy, Ingo Wegener	Solution of the knight's Hamiltonian path problem on chessboards.	Discret. Appl. Math.	1994	DBLP DOI BibTeX RDF
15	Y. Daniel Liang, Raymond Greenlaw, Glenn K. Manacher	NC² Algorithms Regarding Hamiltonian Path and Circuits in Interval Graphs (Extended Abstract).	Canada-France Conference on Parallel and Distributed Computing	1994	DBLP DOI BibTeX RDF
15	Eric T. Bax	Inclusion and Exclusion Algorithm for the Hamiltonian Path Problem.	Inf. Process. Lett.	1993	DBLP DOI BibTeX RDF
15	Ten-Hwang Lai, Shu-Shang Wei	The Edge Hamiltonian Path Problem is NP-Complete for Bipartite Graphs.	Inf. Process. Lett.	1993	DBLP DOI BibTeX RDF
15	Maurice Queyranne, Yaoguang Wang	Hamiltonian path and symmetric travelling salesman polytopes.	Math. Program.	1993	DBLP DOI BibTeX RDF
15	Leroy J. Dickey	Grey codes, towers of Hanoi, Hamiltonian path on the N-cube, and Chinese rings.	ACM SIGAPL APL Quote Quad	1993	DBLP DOI BibTeX RDF
15	Iain A. Stewart	Using the Hamiltonian Path Operator to Capture NP.	J. Comput. Syst. Sci.	1992	DBLP DOI BibTeX RDF
15	Rainer Feldmann, Peter Mysliwietz	The Shuffle Exchange Network has a Hamiltonian Path.	MFCS	1992	DBLP DOI BibTeX RDF
15	Marek Libura	Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems.	Discret. Appl. Math.	1991	DBLP DOI BibTeX RDF
15	Xingxing Yu	Trees and unicyclic graphs with hamiltonian path graphs.	J. Graph Theory	1990	DBLP DOI BibTeX RDF
15	George R. T. Hendry	On minimum degree in Hamiltonian path graphs.	J. Graph Theory	1988	DBLP DOI BibTeX RDF
15	Yuri Gurevich, Saharon Shelah	Expected Computation Time for Hamiltonian Path Problem.	SIAM J. Comput.	1987	DBLP DOI BibTeX RDF
15	George R. T. Hendry	On the hamiltonian path graph of a graph.	J. Graph Theory	1987	DBLP DOI BibTeX RDF
15	Gerald L. Thompson, Sharad Singhal	A successful algorithm for the undirected Hamiltonian path problem.	Discret. Appl. Math.	1985	DBLP DOI BibTeX RDF
15	C. C. Chen, P. Manalastas	Every finite strongly connected digraph of stability 2 has a Hamiltonian path.	Discret. Math.	1983	DBLP DOI BibTeX RDF
15	Gary Chartrand, S. F. Kapoor, E. A. Nordhaus	Hamiltonian path graphs.	J. Graph Theory	1983	DBLP DOI BibTeX RDF
15	Alan A. Bertossi	The Edge Hamiltonian Path Problem is NP-Complete.	Inf. Process. Lett.	1981	DBLP DOI BibTeX RDF
15	Yoshiko Takenaka	On the Existence of a Hamiltonian Path in a Graph	Inf. Control.	1968	DBLP DOI BibTeX RDF
14	Sebastiano Battiato, Giovanni Gallo, Gaetano Impoco, Filippo Stanco	An efficient Re-indexing algorithm for color-mapped images.	IEEE Trans. Image Process.	2004	DBLP DOI BibTeX RDF
14	Dhabaleswar K. Panda 0001, Sanjay Singal, Ram Kesavan	Multidestination Message Passing in Wormhole k-ary n-cube Networks with Base Routing Conformed Paths.	IEEE Trans. Parallel Distributed Syst.	1999	DBLP DOI BibTeX RDF	deadlock-freedom and interprocessor communication, multicast, interconnection networks, broadcast, meshes, Wormhole routing, collective communication, k-ary n-cubes
14	Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener	Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract).	SWAT	1994	DBLP DOI BibTeX RDF	parallel computations, communication algorithms
12	Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia	Matching Points with Squares.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF	Matching, Discrete geometry, Hamiltonian, Delaunay
12	Haizhu Chen, Zhongshi He	A Uniform Solution to HPP in Terms of Membrane Computing.	AICI	2009	DBLP DOI BibTeX RDF	Cellular Complexity Classes, HPP, Membrane Computing, Natural Computing
12	Henning Fernau, Serge Gaspers, Daniel Raible 0001	Exact and Parameterized Algorithms for Max Internal Spanning Tree.	WG	2009	DBLP DOI BibTeX RDF
12	Ying Zhu, Yongsheng Ding, Wanggen Li, Gregory Kemp	A proposed modularized DNA computer, based on biochips.	GEC Summit	2009	DBLP DOI BibTeX RDF	modularized, DNA computer, instruction set architecture, biochips, upgradeable
12	Sien-Tang Tsai	Fast Parallel Molecular Solution for DNA-Based Computing: The 0-1 Knapsack Problem.	ICA3PP	2009	DBLP DOI BibTeX RDF
12	Minsik Cho, Hua Xiang 0001, Ruchir Puri, David Z. Pan	Track Routing and Optimization for Yield.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2008	DBLP DOI BibTeX RDF
12	Wenhong Wei, Wenjun Xiao, Zhen Zhang	Parallel Sorting on the Biswapped Network.	ACIS-ICIS	2008	DBLP DOI BibTeX RDF	Biswapped network (BSN), Cayley digraphs, Sorting, Hamilton
12	Artiom Alhazov, Ion Petre, Vladimir Rogojin	Solutions to Computational Problems Through Gene Assembly.	DNA	2007	DBLP DOI BibTeX RDF
12	Jun Chen, Wei Liu, Yuli Gao, Shouxia Sun	Fluorescence Model of 3-SAT in DNA Computing.	ICIC (3)	2007	DBLP DOI BibTeX RDF	Trichotomy Strategy, Fluorescein-labeled, Parallel, SAT
12	Shlomi Dolev, Hen Fitoussi	The Traveling Beams Optical Solutions for Bounded NP-Complete Problems.	FUN	2007	DBLP DOI BibTeX RDF
12	Minsik Cho, Hua Xiang 0001, Ruchir Puri, David Z. Pan	TROY: Track Router with Yield-driven Wire Planning.	DAC	2007	DBLP DOI BibTeX RDF
12	Linqiang Pan, Artiom Alhazov	Solving HPP and SAT by P Systems with Active Membranes and Separation Rules.	Acta Informatica	2006	DBLP DOI BibTeX RDF
12	Guojun Li, Ying Xu 0001, Chuanping Chen, Zhenhong Liu	On Connected [g, f +1]-Factors in Graphs.	Comb.	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C85
12	Longjiang Guo, Weili Wu 0001, Feng Wang 0002, My T. Thai	An Approximation for Minimum Multicast Route in Optical Networks with Nonsplitting Nodes.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	splitting/nonsplitting node, multicast, optical network
12	Ioan Cleju, Pasi Fränti, Xiaolin Wu 0001	Clustering Based on Principal Curve.	SCIA	2005	DBLP DOI BibTeX RDF
12	Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura	The On-line Asymmetric Traveling Salesman Problem.	WADS	2005	DBLP DOI BibTeX RDF
12	Sun-Yuan Hsieh, Nai-Wen Chang 0002	Cycle Embedding on the Möbius Cube with Both Faulty Nodes and Faulty Edges.	ICPADS (2)	2005	DBLP DOI BibTeX RDF
12	Florin Manea, Carlos Martín-Vide, Victor Mitrana	Accepting Networks of Splicing Processors.	CiE	2005	DBLP DOI BibTeX RDF
12	Mohd Saufee Muhammad, Satomi Ueda, Osamu Ono, Junzo Watada, Marzuki Khalid	Solving Elevator Scheduling Problem Using DNA Computing Approach.	WSTST	2005	DBLP DOI BibTeX RDF
12	Srivatsan Balasubramanian, Wensheng He, Arun K. Somani	Light-Trail Networks: Design and Survivability.	LCN	2005	DBLP DOI BibTeX RDF
12	Erzsébet Csuhaj-Varjú, Arto Salomaa	The Power of Networks of Watson-Crick D0L Systems.	Aspects of Molecular Computing	2004	DBLP DOI BibTeX RDF
12	Florin Manea, Carlos Martín-Vide, Victor Mitrana	Solving 3CNF-SAT and HPP in Linear Time Using WWW.	MCU	2004	DBLP DOI BibTeX RDF