966 search results - page 105 / 194 » Small Alliances in Graphs |
LICS
2010
IEEE
13 years 8 months ago
2010
IEEE
We construct finite groups whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour ...
SODA
2012
ACM
12 years 12 days ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
COCOON
2007
Springer
14 years 4 months ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
EVOW
2007
Springer
14 years 4 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
ICPPW
2005
IEEE
14 years 3 months ago
2005
IEEE
This paper compares two methods for running an application composed of a set of modules on a grid. The set of modules (collectively called Montage) generates large astronomical im...