1951 search results - page 28 / 391 » An algorithm for improving graph partitions |
COCOON
2007
Springer
15 years 4 months ago
2007
Springer
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
158
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
Existing graph mining algorithms typically assume that databases are relatively static and can fit into the main memory. Mining of subgraphs in a dynamic environment is currently ...
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
Standard methods for role assignment partition the vertex set of a graph in such a way that vertices in the same class can be considered to have equivalent roles in the graph. Seve...
DAM
2008
14 years 10 months ago
2008
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
AAAI
2004
14 years 11 months ago
2004
We consider how to use external memory, such as disk storage, to improve the scalability of heuristic search in statespace graphs. To limit the number of slow disk I/O operations,...