760 search results - page 8 / 152 » Algorithms for finding clique-transversals of graphs |
CSC
2006
13 years 9 months ago
2006
- The purpose of this paper is to develop an algorithm to determine the Hamilton Circuit in a given graph of degree three. This algorithm will find Hamilton Circuit in polynomial s...
ICS
2010
Tsinghua U.
14 years 4 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
ENDM
2000
13 years 7 months ago
2000
We propose a new exact algorithm for finding the chromatic number of a graph G. The algorithm attempts to determine the smallest possible induced subgraph G' of G which has t...
WDAG
2007
Springer
14 years 1 months ago
2007
Springer
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
PKDD
2007
Springer
14 years 1 months ago
2007
Springer
Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint commun...