1162 search results - page 15 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
135
Voted
JAL
2006
15 years 3 months ago
2006
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
102
Voted
JGAA
2006
15 years 3 months ago
2006
In this paper we introduce a direct motivation for solving the minimum 2-sum problem, for which we present a linear-time algorithm inspired by the Algebraic Multigrid approach whi...
127
Voted
SAC
2010
ACM
15 years 10 months ago
2010
ACM
This article addresses the problem of efficient multi-robot patrolling in a known environment. The proposed approach assigns regions to each mobile agent. Every region is represen...
110
Voted
TIT
2008
15 years 3 months ago
2008
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
153
Voted
COLOGNETWENTE
2010
15 years 13 days ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...