Login / Signup
Improved bounds for the shortness coefficient of cyclically 4-edge connected cubic graphs and snarks.
Klas Markström
Published in:
CoRR (2013)
Keyphrases
</>
weighted graph
undirected graph
upper bound
edge detection
lower bound
edge information
b spline
connected components
neighborhood graph
graph theoretic
improved algorithm
edge detector
lower and upper bounds
pattern recognition
upper and lower bounds
random graphs
search algorithm