Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs.

Frantisek Kardos Daniel Král'Jan Volec

Published in: Random Struct. Algorithms (2012)

Keyphrases

weighted graph
graph databases
undirected graph
graph model
graph theory
series parallel
b spline
graph matching
graph mining
graph theoretic
random graphs
bipartite graph
social networks
hough transform
lower bound
object recognition
search algorithm
graph clustering
multiscale