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