945 search results - page 47 / 189 » Graph Types |
111
click to vote
CIKM
2005
Springer
15 years 7 months ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
JGAA
2007
15 years 1 months ago
2007
The cluster structure of many real-world graphs is of great interest, as the clusters may correspond e.g. to communities in social networks or to cohesive modules in software syst...
116
click to vote
AAAI
2007
15 years 4 months ago
2007
RDF (“Resource Description Framework”) is now a widely used World Wide Web Consortium standard. However, methods to index large volumes of RDF data are still in their infancy....
125
click to vote
KDD
2010
ACM
15 years 10 days ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
ARSCOM
1999
15 years 1 months ago
1999
Alon and Yuster [4] have proven that if a fixed graph K on g vertices is (h + 1)-colorable, then any graph G with n vertices and minimum degree at least h h+1 n contains at least ...