760 search results - page 4 / 152 » Algorithms for finding clique-transversals of graphs |
102
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
A dominating set D of a graph G = (V, E) is a subset of vertices such that every vertex in V \ D has at least one neighbour in D. Moreover if D is an independent set, i.e. no verti...
148
Voted
WAW
2010
Springer
14 years 11 months ago
2010
Springer
We give algorithms for finding graph clusters and drawing graphs, highlighting local community structure within the context of a larger network. For a given graph G, we use the per...
87
Voted
COCOON
2007
Springer
15 years 8 months ago
2007
Springer
DATE
2005
IEEE
15 years 7 months ago
2005
IEEE
66
Voted
ANOR
2008
15 years 1 months ago
2008