1963 search results - page 29 / 393 » The Maximum Solution Problem on Graphs |
WG
2007
Springer
14 years 2 months ago
2007
Springer
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
DCC
2007
IEEE
14 years 8 months ago
2007
IEEE
This work is motivated by the necessity to automate the discovery of structure in vast and evergrowing collection of relational data commonly represented as graphs, for example ge...
AISS
2010
13 years 6 months ago
2010
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...
IPPS
1999
IEEE
14 years 27 days ago
1999
IEEE
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
ADHOCNOW
2004
Springer
14 years 2 months ago
2004
Springer
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...