4865 search results - page 192 / 973 » The Complexity of Graph Connectivity |
161
Voted
ADC
2008
Springer
15 years 10 months ago
2008
Springer
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
145
Voted
CINQ
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Constrained graphs are directed graphs describing the control flow of processes models. In such graphs, nodes represent activities involved in the process, and edges the ...
151
Voted
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
The World Wide Web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to an...
148
Voted
ALGOSENSORS
2004
Springer
15 years 9 months ago
2004
Springer
We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...
145
click to vote
CMOT
2004
15 years 3 months ago
2004
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...