Results 341 to 348 of about 4,550,446 (348)

Pregel: a system for large-scale graph processing

SIGMOD Conference, 2010
G. Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, I. Horn, Naty Leiser, G. Czajkowski   +6 more
semanticscholar   +1 more source

Freebase: a collaboratively created graph database for structuring human knowledge

SIGMOD Conference, 2008
K. Bollacker, Colin Evans, Praveen K. Paritosh, Tim Sturge, Jamie Taylor   +4 more
semanticscholar   +1 more source

Depth-First Search and Linear Graph Algorithms

SIAM journal on computing (Print), 1972
R. Tarjan
semanticscholar   +1 more source

Efficient Graph-Based Image Segmentation

International Journal of Computer Vision, 2004
Pedro F. Felzenszwalb, D. Huttenlocher
semanticscholar   +1 more source

Supereulerian graphs and the Petersen graph

1991
A graph \(G\) is called supereulerian if \(G\) has a spanning eulerian subgraph. Using a contraction method introduced by \textit{P. A. Catlin} [J. Graph Theory 12, No. 1, 29-44 (1988; Zbl 0659.05073)], the author discusses some best possible conditions for 3-edge-connected graphs to be supereulerian.
openaire   +1 more source

;Graphs, Not Punctuation!

Science, 1981
openaire   +2 more sources

Semitotal graphs of a graph. II

Sampathkumar, E., Chikkodimath, S. B.
openaire   +2 more sources

Graphs and two-graphs

1974
openaire   +1 more source