370 search results - page 21 / 74 » Computational Study on Dominating Set Problem of Planar Grap... |
ALENEX
2009
15 years 24 days ago
2009
In this paper we present an experimental study of several maximum flow algorithms in the context of unbalanced bipartite networks. Our experiments are motivated by a real world pr...
114
click to vote
DAM
2011
14 years 6 months ago
2011
In this paper, we study the Minimum Sum Set Coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersectio...
167
click to vote
IWPEC
2010
Springer
14 years 9 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
EVOW
2004
Springer
15 years 5 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
MHCI
2009
Springer
15 years 6 months ago
2009
Springer
Whenever a pervasive game has to be developed for a group of children an appropriate multi-user setting has to be found. If the pervasive game does not support the children with a...