721 search results - page 105 / 145 » Almost universal graphs |
ICSE
2008
IEEE-ACM
14 years 10 months ago
2008
IEEE-ACM
Model-based development is becoming an increasingly common development methodology. In important domains like embedded systems already major parts of the code are generated from m...
WWW
2008
ACM
14 years 10 months ago
2008
ACM
A large body of work has been devoted to identifying community structure in networks. A community is often though of as a set of nodes that has more connections between its member...
GECCO
2004
Springer
14 years 3 months ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
SODA
2008
ACM
13 years 11 months ago
2008
ACM
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
SIGMETRICS
2008
ACM
13 years 9 months ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...