3008 search results - page 272 / 602 » Independence in connected graphs |
182
click to vote
IFIP12
2007
15 years 8 months ago
2007
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
167
click to vote
ALENEX
2004
15 years 8 months ago
2004
In previous work we described a method for compactly representing graphs with small separators, which makes use of small separators, and presented preliminary experimental results...
178
click to vote
COLOGNETWENTE
2009
15 years 7 months ago
2009
Given a graph G = (V, E), a proper vertex colouring of V is t-frugal if no colour appears more than t times in any neighbourhood and is acyclic if each of the bipartite graphs con...
179
click to vote
CGF
2010
15 years 6 months ago
2010
We present a new approach aimed at understanding the structure of connections in edge-bundling layouts. We combine the advantages of edge bundles with a bundle-centric simplified ...
180
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...