Hamiltonian Paths in the Complete Graph with Edge-Lengths 1, 2, 3.
Stefano CapparelliAlberto Del FraPublished in: Electron. J. Comb. (2010)
Keyphrases
- disjoint paths
- weighted graph
- shortest path
- undirected graph
- directed graph
- random walk
- graph representation
- approximation algorithms
- edge weights
- graph model
- graph structure
- graph databases
- graph partitioning
- path length
- adjacency matrix
- strongly connected
- vertex set
- edge information
- graph mining
- graph theory
- edge detection
- contour closure
- graph based algorithm
- densely connected
- data sets
- graph construction
- random graphs
- graph data
- directed acyclic graph
- bipartite graph
- connected components
- clustering algorithm