354 search results - page 11 / 71 » Algorithms for the Minimum Edge Cover of H-Subgraphs of a Gr... |
CATS
1998
13 years 8 months ago
1998
Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...
TCS
2010
13 years 5 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
SDM
2007
SIAM
13 years 8 months ago
2007
SIAM
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
EPIA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...