5100 search results - page 389 / 1020 » The Linear Complexity of a Graph |
170
click to vote
SC
1995
ACM
15 years 11 months ago
1995
ACM
Recently, a number of researchers have investigated a class of algorithms that are based on multilevel graph partitioning that have moderate computational complexity, and provide ...
222
Voted
KDD
2009
ACM
16 years 8 months ago
2009
ACM
Classifying nodes in networks is a task with a wide range of applications. It can be particularly useful in anomaly and fraud detection. Many resources are invested in the task of...
222
Voted
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
In order to extract high levels of performance from modern parallel architectures, the effective management of deep memory hierarchies is very important. While architectural advan...
176
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...
208
click to vote
APVIS
2006
15 years 9 months ago
2006
In the present paper, we introduce a multi-user interactive framework for solving complex optimization problems. The framework, called Co-UserHints, provides a visual computationa...