5889 search results - page 234 / 1178 » Graph Layout Problems |
268
click to vote
IWPEC
2010
Springer
15 years 4 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
286
click to vote
ICDE
2006
IEEE
16 years 8 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...
197
click to vote
ICPR
2008
IEEE
16 years 7 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...
165
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...
197
Voted
IWPC
2002
IEEE
15 years 11 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...