1149 search results - page 60 / 230 » Minimally non-Pfaffian graphs |
ICDM
2007
IEEE
15 years 6 months ago
2007
IEEE
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 simila...
CC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. To reason about programs, dynamic optimizers and analysis tools use sampling to collect a dynamic call graph (DCG). However, sampling has not achieved high accuracy with ...
ESA
2005
Springer
15 years 5 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...
TIT
1998
14 years 11 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 ...
SADM
2008
14 years 11 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...