1633 search results - page 127 / 327 » Planar Map Graphs |
116
click to vote
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
118
Voted
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
We consider the problem of finding a balanced ordering of the vertices of a graph. More precisely, we want to minimise the sum, taken over all vertices v, of the difference betwe...
111
click to vote
CCECE
2009
IEEE
15 years 5 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 ...
138
Voted
NETWORKS
2010
15 years 24 days ago
2010
We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are...
100
click to vote
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
In this paper we present a simple colorization method that relies on nonlocal graph regularization. We introduce nonlocal discrete differential operators and a family of weighted ...