1097 search results - page 49 / 220 » Testing Graph Isomorphism |
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Our dynamic graph-based relational mining approach has been developed to learn structural patterns in biological networks as they change over time. The analysis of dynamic network...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
FUZZIEEE
2007
IEEE
15 years 4 months ago
2007
IEEE
—Approaches based on conditional independence tests are among the most popular methods for learning graphical models from data. Due to the predominance of Bayesian networks in th...
ISCAS
2003
IEEE
15 years 3 months ago
2003
IEEE
Improving testability during the early stages of High-Level Synthesis (HLS) has several benefits, including reduced test hardware overhead, reduced test costs, reduced design iter...
COMBINATORICA
1999
14 years 9 months ago
1999
We present a sublinear-time algorithm for testing whether a bounded degree graph is bipartite or far from being bipartite. Graphs are represented by incidence lists of bounded len...