3220 search results - page 226 / 644 » Constrained Graph Processes |
151
click to vote
ESA
2004
Springer
15 years 12 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
178
click to vote
HUMAN
2003
Springer
15 years 11 months ago
2003
Springer
Multipath on-demand routing protocols for mobile ad hoc networks try to reduce control overhead and end-to-end delay by computing multiple paths with a single route discovery proce...
178
click to vote
TALG
2010
15 years 1 months ago
2010
We give a polynomial-time algorithm to find a shortest contractible cycle (i.e. a closed walk without repeated vertices) in a graph embedded in a surface. This answers a question ...
168
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
— Secrecy graphs model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely ...
187
click to vote
ICIP
2002
IEEE
16 years 8 months ago
2002
IEEE
In this paper, we present an object contour tracking approach using graph cuts based active contours (GCBAC). Our proposed algorithm does not need any a priori global shape model,...