1963 search results - page 93 / 393 » The Maximum Solution Problem on Graphs |
CVIU
2008
2008
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
13 years 10 months ago
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
PODC
2009
ACM
14 years 10 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
AUTOMATICA
2010
13 years 10 months ago
2010
The spectral properties of the incidence matrix of the communication graph are exploited to provide solutions to two multiagent control problems. In particular, we consider the pr...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...
MST
2010
13 years 4 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...