306 search results - page 48 / 62 » Computing the Girth of a Planar Graph |
121
click to vote
CCECE
2009
IEEE
15 years 6 months ago
2009
IEEE
In this paper we investigate the limits of routing according to left- or righthand rule (LHR). Using LHR, a node upon receipt of a message will forward to the neighbour that sits ...
116
Voted
TAMC
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
160
Voted
FOCS
1995
IEEE
15 years 7 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
161
Voted
EMMCVPR
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
136
click to vote
EVOW
2004
Springer
15 years 9 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 ...