The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase Hamiltonian-path (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1968-1990 (15) 1991-1994 (19) 1995-1997 (16) 1998-2000 (19) 2001-2002 (22) 2003-2004 (27) 2005 (18) 2006-2007 (23) 2008-2009 (25) 2010-2013 (15) 2014-2019 (15) 2020-2024 (15)
Publication types (Num. hits)
article(107) inproceedings(122)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 228 occurrences of 128 keywords

Results
Found 229 publication records. Showing 229 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
150Tung-Yang Ho, Chun-Nan Hung, Lih-Hsing Hsu On cubic 2-independent Hamiltonian connected graphs. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Connectivity, Hamiltonian, Hamiltonian connected
100Sun-Yuan Hsieh, Yu-Fen Weng Fault-Tolerant Embedding of Pairwise Independent Hamiltonian Paths on a Faulty Hypercube with Edge Faults. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Pairwise independent Hamiltonian paths, Hypercubes, Hamiltonian, Graph-theoretic interconnection networks, Fault-tolerant embedding
88Sun-Yuan Hsieh Fault-Tolerant Mutually Independent Hamiltonian Cycles Embedding on Hypercubes. Search on Bibsonomy ICICIC (2) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
76Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim Fault-Hamiltonicity of Hypercube-Like Interconnection Networks. Search on Bibsonomy IPDPS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
74Uwe Leck A Class of 2-Colorable Orthogonal Double Covers of Complete Graphs by Hamiltonian Paths. Search on Bibsonomy Graphs Comb. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
73Oswaldo Vernet, Lilian Markenzon Hamiltonian Problems for Reducible Flowgraphs. Search on Bibsonomy SCCC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF Hamiltonian problems, reducible flowgraphs, unique Hamiltonian cycle, source vertex, Hamiltonian cycle, Hamiltonian path, flow graphs
72Csaba Biró, David M. Howard 0002 The First Three Levels of an Order Preserving Hamiltonian Path in the Subset Lattice. Search on Bibsonomy Order The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Boolean lattice, Gray code, Hamiltonian path
70Sun-Yuan Hsieh Fault-Free Pairwise Independent Hamiltonian Paths on Faulty Hypercubes. Search on Bibsonomy Asia-Pacific Computer Systems Architecture Conference The full citation details ... 2006 DBLP  DOI  BibTeX  RDF pairwise independent Hamiltonian paths, Interconnection networks, hypercubes, Hamiltonian, fault-tolerant embedding
64Neng-Chung Wang, Chih-Ping Chu, Tzung-Shi Chen Dual-Hamiltonian-Path-Based Multicasting on Wormhole-Routed Star Graph Interconnection Networks. Search on Bibsonomy ICPADS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Multicast, wormhole routing, virtual channels, star graphs, path-based routing
64Ray-Shang Lo, Gen-Huey Chen Embedding Hamiltonian Paths in Faulty Arrangement Graphs with the Backtracking Method. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Hamiltonian cycle, star graph, Hamiltonian path, graph-theoretic interconnection network, fault-tolerant embedding, Arrangement graph
62Q. S. Wu, Chin Lung Lu, Richard C. T. Lee An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree. Search on Bibsonomy ISAAC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
57Tamara Mchedlidze, Antonios Symvonis Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings. Search on Bibsonomy WALCOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
57Sanjeev Baskiyar Simulating DNA Computing. Search on Bibsonomy HiPC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Simulation, Parallel Computing, DNA, Hamiltonian path, Educational tool
54Antonio Alonso-Ayuso, Paolo Detti, Laureano F. Escudero, M. Teresa Ortuño On Dual Based Lower Bounds for the Sequential Ordering Problem with Precedences and Due Dates. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF sequential ordering problem, due dates, minimum arborescence, permutation path, Lagrangian relaxation, Hamiltonian path, precedences
52M. Reza HoseinyFarahabady, Hamid Sarbazi-Azad The Grid-Pyramid: A Generalized Pyramid Network. Search on Bibsonomy J. Supercomput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF WK-recursive mesh, Hypermesh, Link-disjoint Hamiltonian cycles, Interconnection networks, Mesh, Torus, Hamiltonian cycle, Hamiltonian path, Pyramid, Hamiltonian-connectivity, Pancyclicity
49Muhammad Faiz Mohamed Saaid, Zuwairie Ibrahim, Nor Haniza Sarmin An Improved In Silico Algorithm for Output Visualization of DNA Computing Based on Real-Time PCR. Search on Bibsonomy Asia International Conference on Modelling and Simulation The full citation details ... 2008 DBLP  DOI  BibTeX  RDF real-time PCR, TaqMan probes, DNA Computing
49Mihai Oltean Solving the Hamiltonian path problem with a light-based computer. Search on Bibsonomy Nat. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Light-based computing, NP-complete, Hamiltonian path
49Jung-Sheng Fu Hamiltonicity of the WK-Recursive Network with and without Faulty Nodes. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF WK-recursive, interconnection network, embedding, Hamiltonian cycle, fault-tolerant embedding, Hamiltonian-connected
48Zuwairie Ibrahim, John A. Rose, Akira Suyama, Marzuki Khalid Experimental implementation and analysis of a DNA computing readout method based on real-time PCR with TaqMan probes. Search on Bibsonomy Nat. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Graduated PCR, Readout method, Real-time PCR, TaqMan probes, DNA computation, Hamiltonian path problem
45Anna Galluccio, Guido Proietti Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths. Search on Bibsonomy ISAAC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF 2-edge connectivity, Graph, Hamiltonian path, network survivability, augmentation
39Jung-Sheng Fu Hamiltonian-Connectedness of the WK-Recursive Network. Search on Bibsonomy ISPAN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF WK-recursive, interconnection network, embedding, Hamiltonian-connected
39Esther M. Arkin, Martin Held, Joseph S. B. Mitchell, Steven Skiena Hamiltonian triangulations for fast rendering. Search on Bibsonomy Vis. Comput. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Quadrangulation, Computer graphics, Rendering, Triangulations, Hamiltonian paths
39Iain A. Stewart Using the Hamiltonian Path Operator to Capture NP. Search on Bibsonomy ICCI The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
35Jakub Cerný, Zdenek Dvorák 0001, Vít Jelínek, Jan Kára Noncrossing Hamiltonian Paths in Geometric Graphs. Search on Bibsonomy GD The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
34Nicolas Beldiceanu, Pierre Flener, Xavier Lorca Combining Tree Partitioning, Precedence, and Incomparability Constraints. Search on Bibsonomy Constraints An Int. J. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Digraph partitioning, Tree constraint, Incomparability constraint, Ordered disjoint paths problem, Phylogenetic supertree problem, Filtering, Tree, Global constraint, Precedence constraint, Hamiltonian path problem
34Artiom Alhazov, Ion Petre, Vladimir Rogojin Solutions to computational problems through gene assembly. Search on Bibsonomy Nat. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Stichotrichous, Gene assembly, Intramolecular model, Ciliate-based computing, DNA computing, Hamiltonian path problem, Ciliates
34Zhixiang Yin, Jin Yang, Jianzhong Cui, Jiaxiu Zhang Evolutionary Model for Sequence Generation. Search on Bibsonomy ICIC (1) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF DNA Sequence Generation System, DNA coding method, DNA computing, Hamiltonian path problem, Evolution model
34Max H. Garzon, Derrel Blain, Kiranchand V. Bobba, Andrew Neel, Michael West Self-Assembly of DNA-like Structures In Silico. Search on Bibsonomy Genet. Program. Evolvable Mach. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF online genetic algorithms, DNA-based associative memories, efficiency of DNA computing, reaction kinetics in DNA-based computational protocols, Hamiltonian path problem
34Juan Castellanos, Gheorghe Paun, Alfonso Rodríguez-Patón Computing with Membranes: P Systems with Worm-Objects. Search on Bibsonomy SPIRE The full citation details ... 2000 DBLP  DOI  BibTeX  RDF worm-objects, string multisets, output membrane, recursively enumerable sets, quadratic time, membrane division, computational complexity, directed graph, NP-complete problem, symbols, P systems, linear time, SAT problem, Hamiltonian Path Problem, polynomial solution
34D. Rooß Recent Developments in DNA-Computing. Search on Bibsonomy ISMVL The full citation details ... 1997 DBLP  DOI  BibTeX  RDF test tubes, time complexity, DNA-computing, DNA, space complexity, Hamiltonian path problem, theoretical computer science
34Anjan K. Venkatramani, Timothy Mark Pinkston, José Duato Generalized Theory for Deadlock-Free Adaptive Wormhole Routing and its Application to Disha Concurrent. Search on Bibsonomy IPPS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF deadlock-free adaptive wormhole routing, Disha Concurrent, central buffers, sequential recovery, resource cost, mutual exclusive access, deadlock-free lane, tree-based networks, performance evaluation, parallel architectures, fault tolerant computing, concurrency control, multiprocessor interconnection networks, multiprocessor interconnection networks, network routing, system recovery, edge, Token, Hamiltonian path, deadlock recovery, k-ary n-cube networks
33Tamara Mchedlidze, Antonios Symvonis Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs. Search on Bibsonomy COCOON The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
30Gur Saran Adhar, Shietung Peng Parallel Algorithms for Path Covering, Hamiltonian Path and Hamiltonian Cycle in Cographs. Search on Bibsonomy ICPP (3) The full citation details ... 1990 DBLP  BibTeX  RDF
30Mingchu Li Hamiltonian Connected Claw-Free Graphs. Search on Bibsonomy Graphs Comb. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
29Lucas Ledesma, Juan Pazos, Alfonso Rodríguez-Patón A DNA Algorithm for the Hamiltonian Path Problem Using Microfluidic Systems. Search on Bibsonomy Aspects of Molecular Computing The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
29Ryuhei Uehara, Yushi Uno Efficient Algorithms for the Longest Path Problem. Search on Bibsonomy ISAAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF graph classes, longest path problem, Efficient algorithms
29Shahram Latifi, Myung Hoon Lee, Pradip K. Srimani Wormhole Broadcast in Hypercubes. Search on Bibsonomy J. Supercomput. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF broadcasting, hypercubes, wormhole routing, gray codes
27Tamara Mchedlidze, Antonios Symvonis Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
27Wei Meng, Shengjia Li Semicomplete Multipartite Digraphs Whose Every Arc Is Contained in a Hamiltonian Path. Search on Bibsonomy International Conference on Computational Science (3) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Semicomplete multipartite digraph, Semi-partition complete digraphs, Hamiltonian paths
27Sun-Yuan Hsieh, Nai-Wen Chang 0002 Hamiltonian Path Embedding and Pancyclicity on the Möbius Cube with Faulty Nodes and Faulty Edges. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Möbius cubes, Hamiltonian, Graph-theoretic interconnection networks, fault-tolerant embedding, pancyclicity
27Mihai Oltean A Light-Based Device for Solving the Hamiltonian Path Problem. Search on Bibsonomy UC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
27Nen-Chung Wang, Chih-Ping Chu An Efficient Tree-Based Multicasting Algorithm on Wormhole-Routed Star Graph Interconnection Networks Embedded with Hamiltonian Path. Search on Bibsonomy J. Supercomput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF parallel computing, multicast, wormhole routing, star graphs, tree-based routing
27Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert On the Stability of Approximation for Hamiltonian Path Problems. Search on Bibsonomy SOFSEM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
27Davide Bilò, Guido Proietti A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path. Search on Bibsonomy WAOA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
27David Harlan Wood, Catherine L. Taylor Clelland, F. Carter Bancroft Universal Biochip Readout of Directed Hamiltonian Path Problems. Search on Bibsonomy DNA The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
26Dietrich Kuske, Markus Lohrey Hamiltonicity of automatic graphs. Search on Bibsonomy IFIP TCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
26Zuwairie Ibrahim, Tri Basuki Kurniawan, Marzuki Khalid A DNA sequence design for molecular computation of HPP with output visualization based on real-time PCR. Search on Bibsonomy IEEE Congress on Evolutionary Computation The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
26Zuwairie Ibrahim, Muhammad Faiz Mohamed Saaid, Ali S. Paramita, Akira Suyama, John A. Rose An improved readout method of molecular computation based on real-time PCR implemented on DNA Engine Opticon 2 System. Search on Bibsonomy IEEE Congress on Evolutionary Computation The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
26Zuwairie Ibrahim, John A. Rose, Yusei Tsuboi, Osamu Ono, Marzuki Khalid A New Readout Approach in DNA Computing Based on Real-Time PCR with TaqMan Probes. Search on Bibsonomy DNA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
25Nikola Jedlicková, Jan Kratochvíl Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
25Jørgen Bang-Jensen, Mohamed El Haddad, Yannis Manoussakis, Teresa M. Przytycka Parallel Algorithms for the Hamiltonian Cycle and Hamiltonian Path Problems in Semicomplete Bipartite Digraphs. Search on Bibsonomy Algorithmica The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
25Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. Search on Bibsonomy J. Algorithms The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
25Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. Search on Bibsonomy PARLE The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
25Glenn K. Manacher, Terrance A. Mankus, Carol Joan Smith An Optimum Theta (n log n) Algorithm for Finding a Canonical Hamiltonian Path and a Canonical Hamiltonian Circuit in a Set of Intervals. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
24Yi-Jen Chiang New Approximation Results for the Maximum Scatter TSP. Search on Bibsonomy Algorithmica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Traveling salesperson problem (TSP), Maximum scatter TSP, Bottleneck TSP, Hamiltonian cycle/path, Optimization, Approximation algorithms, Matching
23Tom Head An Aqueous Algorithm for Finding the Bijections Contained in a Binary Relation. Search on Bibsonomy Formal and Natural Computing The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
23Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs. Search on Bibsonomy WG The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
23Shih-Chang Wang, Hung-Yau Lin, Sy-Yen Kuo, Yennun Huang A Simple and Efficient Deadlock Recovery Scheme for Wormhole Routed 2-Dimensional Meshes. Search on Bibsonomy PRDC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
23Sajal K. Das 0001, Maria Cristina Pinotti O(log log N) Time Algorithms for Hamiltonian-Suffix and Min-Max-Pair Heap Operations on Hypercube Multicomputers. Search on Bibsonomy IPPS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
23Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho Hamiltonian-Laceability of Star Graphs. Search on Bibsonomy ISPAN The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
23Evripidis Bampis, Yannis Manoussakis, Ioannis Milis NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments (Extended Abstract). Search on Bibsonomy WG The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
23Steven Rudich, Leonard Berman Optimal Circuits and Transitive Automorphism Groups. Search on Bibsonomy ICALP The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
22Robert Ganian, Petr Hlinený Better Polynomial Algorithms on Graphs of Bounded Rank-Width. Search on Bibsonomy IWOCA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Rank-width, rank-decomposition, chromatic polynomial, Hamiltonian path, chromatic number
22Ryuhei Uehara Simple Geometrical Intersection Graphs. Search on Bibsonomy WALCOM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF grid intersection graphs, graph isomorphism, interval graphs, Hamiltonian path problem
22Gábor Salamon Approximation Algorithms for the Maximum Internal Spanning Tree Problem. Search on Bibsonomy MFCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Spanning tree leaves, Approximation algorithm, Hamiltonian path
22Chun-Hsi Huang, Sanguthevar Rajasekaran, Laurence Tianruo Yang, Xin He Finding Hamiltonian paths in tournaments on clusters. Search on Bibsonomy Clust. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Graph applications, Parallel computing, Cluster computing, Hamiltonian path, Tournaments
22Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pandurangan A random graph approach to NMR sequential assignment. Search on Bibsonomy RECOMB The full citation details ... 2004 DBLP  DOI  BibTeX  RDF automated sequential resonance assignment, chemical shift degeneracy, nuclear magnetic resonance (NMR) spectroscopy, protein structure determination, randomized algorithm, probabilistic analysis, hamiltonian path, random graph model
22Mohammad Sohel Rahman, Mohammod Abul Kashem Degree restricted spanning trees of graphs. Search on Bibsonomy SAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF algorithms, graphs, NP-completeness, spanning trees, Hamiltonian path
22Christophe Guillon, Fabrice Rastello, Thierry Bidault, Florent Bouchez Procedure placement using temporal-ordering information: dealing with code size expansion. Search on Bibsonomy CASES The full citation details ... 2004 DBLP  DOI  BibTeX  RDF min-matching, profiling, instruction cache, Hamiltonian-path, cache miss, code size, code placement
22Jacek Blazewicz, Marek Figlerowicz, Przemyslaw Jackowiak, Dariusz Janny, Dariusz Jarczynski, Marta Kasprzak, Maciej Nalewaj, Bartosz Nowierski, Rafal Styszynski, Lukasz Szajkowski, Pawel Widera Parallel DNA Sequence Assembly. Search on Bibsonomy ENC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF DNA sequence assembly, pairwise alignment, Hamiltonian path
22Jie Wu 0001, Stephan Olariu On Cost-Optimal Merge of Two Intransitive Sorted Sequences. Search on Bibsonomy IPDPS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF sorting, merging, PRAM, Hamiltonian path, tournament
22Ray-Shang Lo, Gen-Huey Chen Embedding Hamiltonian paths in faulty arrangement graphs with the backtracking method. Search on Bibsonomy SIGCPR The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Hamiltonian cycle, star graph, Hamiltonian path, graph-theoretic interconnection network, fault-tolerant embedding, arrangement graph
22Jie Wu 0001 On Sorting an Intransitive Total Ordered Set Using Semi-Heap. Search on Bibsonomy IPDPS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Data structure, sorting, directed graph, Hamiltonian path, heap, total order
22Dolors Royo, Antonio González 0001, Miguel Valero-García Low Communication Overhead Jacobi Algorithms for Eigenvalues Computation on Hypercubes. Search on Bibsonomy J. Supercomput. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF eigenproblem, Jacobi ordering, CC-cube algorithms, communication pipelining, one port architecture, multiple port architecture, hamiltonian path
22Sajal K. Das 0001, Maria Cristina Pinotti, Falguni Sarkar Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF slope-tree, b-bandwidth slope-heap, load balance, hypercube, priority queue, Hamiltonian path, heap, speed-up
22Brenda S. Baker Approximation Algorithms for NP-Complete Problems on Planar Graphs. Search on Bibsonomy J. ACM The full citation details ... 1994 DBLP  DOI  BibTeX  RDF partition into perfect matchings, partition into triangles, approximation algorithms, NP-complete, planar graphs, dominating set, independent set, vertex cover, approximation schemes, Hamiltonian path, Hamiltonian circuit
22Karla Alwan, Kelly Waters Finding re-entrant knight's tours on n-by-m boards. Search on Bibsonomy ACM Southeast Regional Conference The full citation details ... 1992 DBLP  DOI  BibTeX  RDF Hamiltonian path, Hamiltonian circuit
21Keiichi Kaneko Routing Problems in Incomplete Pancake Graphs. Search on Bibsonomy SNPD The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
21Matthias Kriesell A Contribution to a Conjecture of A. Saito. Search on Bibsonomy Graphs Comb. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
21J. Christopher Beck, Patrick Prosser, Evgeny Selensky Graph Transformations for the Vehicle Routing and Job Shop Scheduling Problems. Search on Bibsonomy ICGT The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
21Khurram Muhammad, Kaushik Roy 0001 A Graph Theoretic Approach for Design and Synthesis of Multiplierless FIR Filters. Search on Bibsonomy ISSS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
21Esther M. Arkin, Martin Held, Joseph S. B. Mitchell, Steven Skiena Hamilton Triangulations for Fast Rendering. Search on Bibsonomy ESA The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
19Kyriaki Ioannidou, George B. Mertzios, Stavros D. Nikolopoulos The Longest Path Problem Is Polynomial on Interval Graphs. Search on Bibsonomy MFCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Longest path problem, complexity, dynamic programming, interval graphs, polynomial algorithm
19Rajendra V. Boppana, Suresh Chalasani, Cauligi S. Raghavendra Resource Deadlocks and Performance of Wormhole Multicast Routing Algorithms. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Consumption channels, multicasts, routing algorithms, deadlocks, wormhole routing, multicomputers
16Andrea Gasparri, Bhaskar Krishnamachari, Gaurav S. Sukhatme A framework for multi-robot node coverage in sensor networks. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classifications (2000) 93C85
16Mohd Saufee Muhammad, Zuwairie Ibrahim, Satomi Ueda, Osamu Ono, Marzuki Khalid DNA Computing for Complex Scheduling Problem. Search on Bibsonomy ICNC (2) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
15Jun Wu, Zhen Yang, Guiqing Zhang, Yongxi Cheng An extension of the Christofides heuristic for a single-depot multiple Hamiltonian path problem. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
15Hongbin Zhuang, Xiao-Yan Li, Jou-Ming Chang, Dajin Wang An Efficient Algorithm for Hamiltonian Path Embedding of $k$k-Ary $n$n-Cubes Under the Partitioned Edge Fault Model. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Jun Wu, Yongxi Cheng, Zhen Yang, Feng Chu 0001 A 3/2-approximation algorithm for the multiple Hamiltonian path problem with no prefixed endpoints. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Cícero A. de Lima Emergent chaotic iterations in hard sparse instances of hamiltonian path problem. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Erwan Reinders, Bianca Jansen Van Rensburg, Pauline Puteaux, William Puech MSB-Based Reversible Data-Hiding in Encrypted 3D Object Using a Hamiltonian Path. Search on Bibsonomy MMSP The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Yichen Yang 0007, Zhaohui Liu 0001, Wei Yu 0011 Approximation algorithms for the k-depots Hamiltonian path problem. Search on Bibsonomy Optim. Lett. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
15Rahnuma Islam Nishat, Venkatesh Srinivasan 0001, Sue Whitesides The Hamiltonian Path Graph is Connected for Simple s, t Paths in Rectangular Grid Graphs. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
15Erik D. Demaine, Kritkorn Karntikoon Unfolding Orthotubes with a Dual Hamiltonian Path. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  BibTeX  RDF
15Rahnuma Islam Nishat, Venkatesh Srinivasan 0001, Sue Whitesides The Hamiltonian Path Graph is Connected for Simple s, t Paths in Rectangular Grid Graphs. Search on Bibsonomy COCOON The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
15Xiaojing Yang, Liming Xiong Forbidden Subgraphs for a Graph to Have a Hamiltonian Path Square. Search on Bibsonomy Graphs Comb. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
15Ilkyoo Choi, Jinha Kim A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
15Wei Zhang 0150, Shuwen Wang, Weijie Han, Hai Yu 0001, Zhiliang Zhu 0001 An Image Encryption Algorithm Based on Random Hamiltonian Path. Search on Bibsonomy Entropy The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
15Rüdiger Ehlers, Kai Treutler, Volker Wesling SAT Solving with Fragmented Hamiltonian Path Constraints for Wire Arc Additive Manufacturing. Search on Bibsonomy SAT The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
15Jianli Chen, Ziran Zhu, Qinghai Liu, Yimin Zhang, Wenxing Zhu, Yao-Wen Chang Hamiltonian Path Based Mixed-Cell-Height Legalization for Neighbor Diffusion Effect Mitigation. Search on Bibsonomy DAC The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 229 (100 per page; Change: )
Pages: [1][2][3][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license