966 search results - page 42 / 194 » Small Alliances in Graphs |
103
click to vote
APPROX
2007
Springer
15 years 7 months ago
2007
Springer
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
121
click to vote
ICPR
2004
IEEE
16 years 2 months ago
2004
IEEE
Given two or more images, we can define different but related problems on pattern matching such as image registration, pattern detection and localization, and common pattern disco...
144
click to vote
ICML
2007
IEEE
16 years 2 months ago
2007
IEEE
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
101
click to vote
WAW
2009
Springer
15 years 8 months ago
2009
Springer
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
164
click to vote
COMPGEOM
2010
ACM
15 years 6 months ago
2010
ACM
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing ...