823 search results - page 123 / 165 » Brick partitions of graphs |
104
click to vote
WEA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
130
click to vote
CIKM
2008
Springer
15 years 3 months ago
2008
Springer
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
125
click to vote
ASUNAM
2010
IEEE
15 years 3 months ago
2010
IEEE
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
147
click to vote
TMM
2010
14 years 8 months ago
2010
Previous video summarization studies focused on monocular videos, and the results would not be good if they were applied to multi-view videos directly, due to problems such as the ...
ICCV
2001
IEEE
16 years 3 months ago
2001
IEEE
We introduce a new graph-theoretic approach to image segmentation based on minimizing a novel class of `mean cut' cost functions. Minimizing these cost functions corresponds ...