6740 search results - page 280 / 1348 » An s -Hamiltonian Line Graph Problem |
215
click to vote
ICDE
2006
IEEE
16 years 2 months ago
2006
IEEE
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
123
click to vote
ICPR
2008
IEEE
16 years 2 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...
92
Voted
KDD
2004
ACM
16 years 1 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...
124
click to vote
IWPC
2002
IEEE
15 years 5 months 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...
110
click to vote
STACS
2001
Springer
15 years 5 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...