76 search results - page 11 / 16 » On a Network Generalization of the Minmax Theorem |
MKM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present a computational origami construction of Morley’s triangles and automated proof of correctness of the generalized Morley’s theorem in a streamlined process ...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— We investigate the spatial distribution of wireless nodes that can transport a given volume of traffic in a sensor network, while requiring the minimum number of wireless node...
NETWORKS
2011
12 years 10 months ago
2011
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
SIGSOFT
2007
ACM
14 years 8 months ago
2007
ACM
Finding flaws in security protocol implementations is hard. Finding flaws in the implementations of sensor network security protocols is even harder because they are designed to p...