2137 search results - page 194 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
181
click to vote
ICPR
2008
IEEE
16 years 26 days ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
209
click to vote
MOBICOM
2006
ACM
16 years 11 days ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
178
click to vote
CIAC
1997
Springer
15 years 10 months ago
1997
Springer
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...
179
click to vote
ICDCS
2006
IEEE
16 years 14 days ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
171
click to vote
SIGMOD
1998
ACM
15 years 10 months ago
1998
ACM
Semistructured data is characterized by the lack of any fixed and rigid schema, although typically the data hassomeimplicitstructure. While thelack offixedschemamakesextracting ...