4171 search results - page 240 / 835 » Choice numbers of graphs |
150
click to vote
ACCV
2010
Springer
15 years 1 months ago
2010
Springer
The Viewing Graph [1] represents several views linked by the corresponding fundamental matrices, estimated pairwise. Given a Viewing Graph, the tuples of consistent camera matrices...
201
click to vote
KDD
2004
ACM
16 years 7 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 ...
170
click to vote
AAIM
2009
Springer
16 years 1 months ago
2009
Springer
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
206
click to vote
SDM
2004
SIAM
15 years 8 months ago
2004
SIAM
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
175
click to vote
IPL
2008
15 years 6 months ago
2008
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...