Long cycles passing through a specified edge in a 3-connected graph.
Hikoe EnomotoKazuhide HirohataKatsuhiro OtaPublished in: J. Graph Theory (1997)
Keyphrases
- weighted graph
- connected components
- undirected graph
- disjoint paths
- graph representation
- edge weights
- vertex set
- strongly connected
- neighborhood graph
- edge detection
- random walk
- graph structure
- graph model
- edge information
- connected graphs
- graph matching
- binary images
- graph databases
- directed acyclic graph
- structured data
- graph mining
- graph search
- graph construction
- image processing
- pairwise
- stable set
- np hard
- adjacency matrix
- directed graph
- graphical representation
- graph partitioning
- spanning tree
- database