2314 search results - page 187 / 463 » Minimal Partitions of a Graph |
120
Voted
DM
2006
15 years 4 months ago
2006
We study the problem of minimal triangulation of graphs. One of the first algorithms to solve this problem was Lex M, which was presented in 1976. A new algorithm, and a simplific...
224
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
162
click to vote
SOFSEM
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we deal with making drawings of clustered hierarchical graphs nicer. Given a planar graph G = (V, E) with an assignment of the vertices to horizontal layers, a plane ...
150
click to vote
3DPVT
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper we propose a novel framework for efficiently extracting foreground objects in so called shortbaseline image sequences. We apply the obtained segmentation to improve...
133
click to vote
ICDM
2005
IEEE
15 years 9 months ago
2005
IEEE
Many real applications can be modeled using bipartite graphs, such as users vs. files in a P2P system, traders vs. stocks in a financial trading system, conferences vs. authors ...