5473 search results - page 209 / 1095 » On the graph isomorphism problem |
215
click to vote
ICPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...
194
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
219
click to vote
IWPC
2002
IEEE
16 years 3 days ago
2002
IEEE
Program slicing has many applications in software engineering activities including program comprehension, debugging, testing, maintenance, and model checking. In this paper, we pr...
191
click to vote
STACS
2001
Springer
15 years 11 months ago
2001
Springer
Langton’s ant is a simple discrete dynamical system, with a surprisingly complex behavior. We study its extension to general planar graphs. First we give some relations between c...
217
click to vote
COLOGNETWENTE
2007
15 years 8 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...