GECCO
2010
Springer
13 years 3 months ago
2010
Springer
A multiobjective genetic algorithm for detecting communities in dynamic networks, i.e., networks that evolve over time, is proposed. The approach leverages on the concept of evolu...
COLOGNETWENTE
2010
13 years 4 months ago
2010
COLOGNETWENTE
2010
13 years 4 months ago
2010
An interval total t coloring of a graph G is a total coloring of with colors 1, such that at least one vertex or edge of is colored by color − G 2, ,t… G , 1, 2, ,i i t= … ,...
COLOGNETWENTE
2010
13 years 4 months ago
2010
Bisimplicial edges in bipartite graphs are closely related to pivots in Gaussian elimination that avoid turning zeroes into non-zeroes. We present a new deterministic algorithm to...
COLOGNETWENTE
2010
13 years 4 months ago
2010
COLOGNETWENTE
2010
13 years 4 months ago
2010
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
COLOGNETWENTE
2010
13 years 4 months ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
COLOGNETWENTE
2010
13 years 4 months ago
2010
ATMOS
2010
13 years 4 months ago
2010
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
ATMOS
2010
13 years 4 months ago
2010
Today’s ride sharing services still mimic a better billboard. They list the offers and allow to search for the source and target city, sometimes enriched with radial search. So...