1951 search results - page 174 / 391 » An algorithm for improving graph partitions |
145
click to vote
JSSPP
2010
Springer
15 years 2 months ago
2010
Springer
Many computational solutions can be expressed as directed acyclic graphs (DAGs) with weighted nodes. In parallel computing, scheduling such DAGs onto manycore processors remains a ...
123
click to vote
ICCV
2001
IEEE
16 years 7 months ago
2001
IEEE
We introduce a new graph-theoretic approach to image segmentation based on minimizing a novel class of `mean cut' cost functions. Minimizing these cost functions corresponds ...
174
click to vote
STACS
2010
Springer
16 years 18 hour ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
154
click to vote
CIAC
2006
Springer
15 years 8 months ago
2006
Springer
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
254
click to vote
SIGMOD
2007
ACM
16 years 5 months ago
2007
ACM
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...