Longest paths in 2-edge-connected cubic graphs.
Nikola K. BlanchardEldar FischerOded LachishFelix ReidlPublished in: CoRR (2019)
Keyphrases
- weighted graph
- disjoint paths
- undirected graph
- shortest path
- directed graph
- minimum spanning trees
- neighborhood graph
- edge detection
- edge information
- connected components
- graph theory
- connected graphs
- b spline
- bipartite graph
- graph partitioning
- graph structure
- data sets
- minimal paths
- neural network
- vertex set
- series parallel
- edge weights
- graph theoretic
- maximum number
- graph matching
- graph construction
- pattern recognition
- strongly connected
- adjacency graph
- image processing
- np complete
- graph model