On the Existence of a Long Path Between Specified Vertices in a 2-Connected Graph.
Kazuhide HirohataPublished in: Graphs Comb. (2000)
Keyphrases
- connected graphs
- weighted graph
- edge weights
- shortest path
- strongly connected
- connected components
- adjacency matrix
- random graphs
- labeled graphs
- undirected graph
- vertex set
- hamiltonian cycle
- solution path
- planar graphs
- directed edges
- attributed graphs
- shortest path problem
- average degree
- graph theory
- directed graph
- query graph
- path length
- structured data
- neighborhood graph
- random walk
- maximum matching
- graph matching
- graph representation
- bipartite graph
- graph structure
- graph model
- minimum weight
- maximum cardinality
- hamiltonian path
- phase transition
- graph partitioning
- maximal cliques
- spanning tree
- betweenness centrality
- root node
- graph data
- minimum spanning tree
- binary images
- mobile robot