2304 search results - page 151 / 461 » On the Vulnerability of Large Graphs |
194
click to vote
KDD
2004
ACM
16 years 6 months ago
2004
ACM
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
175
click to vote
EVOW
2009
Springer
16 years 1 months ago
2009
Springer
We present a hybrid evolutionary algorithm for the graph coloring problem (Evocol). Evocol is based on two simple-but-effective ideas. First, we use an enhanced crossover that col...
160
click to vote
CIKM
2003
Springer
15 years 11 months ago
2003
Springer
Traffic analysis, in the context of Telecommunications or Internet and Web data, is crucial for large network operations. Data in such networks is often provided as large graphs w...
165
click to vote
VIP
2003
15 years 7 months ago
2003
When the amount of information in visualization becomes large enough, users can not perceive all elements at the same time. This problem can be solved by removing parts of the inf...
156
click to vote
ICCAD
1999
IEEE
15 years 10 months ago
1999
IEEE
Abstract-- ECO routing is a very important design capability in advanced IC, MCM and PCB designs when additional routings need to be made at the latter stage of the physical design...