Local search algorithms for finding the Hamiltonian completion number of line graphs
DOI10.1007/S10479-007-0231-ZzbMATH Open1130.05056OpenAlexW2016983303MaRDI QIDQ2468757FDOQ2468757
Authors: Paolo Detti, C. Meloni, Marco Pranzo 
Publication date: 25 January 2008
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-007-0231-z
Recommendations
- A linear algorithm for the Hamiltonian completion number of the line graph of a tree
- Hamiltonian iterated line graphs
- A lower bound on the Hamiltonian path completion number of a line graph
- A linear algorithm for the Hamiltonian completion number of the line graph of a cactus.
- scientific article; zbMATH DE number 1439412
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal path cover problem on block graphs and bipartite permutation graphs
- An optimal path cover algorithm for cographs
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Linear algorithm for optimal path cover problem on interval graphs
- Variable neighborhood search: Principles and applications
- Stochastic local search. Foundations and applications.
- Guided local search with shifting bottleneck for job shop scheduling
- Title not available (Why is that?)
- Title not available (Why is that?)
- Set-up coordination between two stages of a supply chain
- Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
- The edge Hamiltonian path problem is NP-complete
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- A linear algorithm for the Hamiltonian completion number of the line graph of a tree
- The total interval number of a graph
- The total interval number of a tree and the Hamiltonian completion number of its line graph
- A result on Hamiltonian line graphs involving restrictions on induced subgraphs
- A linear algorithm for the Hamiltonian completion number of a tree
- Algorithms for Page Retrieval and Hamiltonian Paths on Forward-Convex Line Graphs
- The total interval number of a graph. I: Fundamental classes
- Minimum node disjoint path covering for circular-arc graphs
- Title not available (Why is that?)
- A linear algorithm for the Hamiltonian completion number of the line graph of a cactus.
- Process selection and sequencing in a two-agents production system
- Parallel algorithms for Hamiltonian problems on quasi-threshold graphs
- Hamiltonian completions of sparse random graphs
- Hamiltonian shortage, path partitions of vertices, and matchings in a graph
- Minimum Dominating Trail Set for Two-Terminal Series Parallel Graphs
Cited In (5)
- Evolving test instances of the Hamiltonian completion problem
- A linear algorithm for the Hamiltonian completion number of the line graph of a tree
- Evolutionary operators for the Hamiltonian completion problem
- A lower bound on the Hamiltonian path completion number of a line graph
- A linear algorithm for the Hamiltonian completion number of the line graph of a cactus.
This page was built for publication: Local search algorithms for finding the Hamiltonian completion number of line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2468757)
