A Heuristic Algorithm for Finding Edge Disjoint Cycles in Graphs.

Renren Dong Ray Kresman

Published in: ICSOFT (Selected Papers) (2010)

Keyphrases

edge disjoint
spanning tree
total length
minimum cost
undirected graph
graph matching
real time
information systems
information retrieval
weighted graph
neural network
similarity measure
search algorithm
network structure