2314 search results - page 242 / 463 » Minimal Partitions of a Graph |
132
click to vote
ESA
2005
Springer
15 years 10 months ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
112
click to vote
GD
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...
146
click to vote
IDA
2007
Springer
15 years 4 months ago
2007
Springer
An important area of data mining is anomaly detection, particularly for fraud. However, little work has been done in terms of detecting anomalies in data that is represented as a g...
125
click to vote
TIT
1998
15 years 4 months ago
1998
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
129
click to vote
SADM
2008
15 years 4 months ago
2008
: In this paper, we introduce the concept of -orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are -orthogonal if their similarit...