1952 search results - page 164 / 391 » Complete partitions of graphs |
137
click to vote
KDD
2006
ACM
16 years 5 months ago
2006
ACM
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
137
click to vote
WG
2004
Springer
15 years 10 months ago
2004
Springer
In this paper, we consider the recognition problem on two classes of perfectly orderable graphs, namely, the HHD-free and the Welsh-Powell opposition graphs (or WPO-graphs). In par...
158
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...
191
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
138
click to vote
NIPS
2000
15 years 6 months ago
2000
We use graphical models to explore the question of how people learn simple causal relationships from data. The two leading psychological theories can both be seen as estimating th...