This is a preview. Log in through your library . Abstract We give a survey of graph spectral techniques used in computer sciences. The survey consists of a description of particular topics from the ...

On the 19th of February 2025, M.Sc. Andreas Grigorjew defends his PhD thesis on Algorithms and Graph Structures for Splitting Network Flows, in Theory and Practice. The thesis is related to research ...

Expanders graphs are sparse but well-connected. These seemingly contrasting properties have led to many applications in theoretical computer science, from complexity ...

With a $9.2 million grant from Intelligence Advanced Research Projects Activity (IARPA), Prof. Andrew A. Chien will lead a team of University of Chicago computer science researchers building the ...

A research team has developed a new technology that enables to process a large-scale graph algorithm without storing the graph in the main memory or on disks. A KAIST research team has developed a new ...

Scientists at UCL, Google DeepMind and Intrinsic have developed a powerful new AI algorithm that enables large sets of ...

Researchers thought that they were five years away from solving a math riddle from the 1980's. In reality, and without knowing, they had nearly cracked the problem and had just given away much of the ...

The K-Computer in Japan continues to top the Graph 500 ranking of the world’s fastest supercomputers. The latest list was released today at SC16 in Salt Lake City. The Graph 500 measures performance ...