Browse All Reviews
Mathematics Of Computing (G)
Discrete Mathematics (G.2)
Graph Theory (G.2.2)
> Graph Algorithms (G.2.2...)
All Media Types
1-10 of 323 Reviews about "
Graph Algorithms (G.2.2...)
Practical minimum cut algorithms
Henzinger M., Noe A., Schulz C., Strash D. Journal of Experimental Algorithmics 231-8, 2018. Type: Article
Due to the ever-increasing deployment of graph theory in natural and artificial phenomena, it is challenging for scientists to utilize it in a more performant manner. One of the most popular topics in graph and networking theory, the authors try t...
Jul 10 2019
Euclidean distance geometry: an introduction
Liberti L., Lavor C., Springer International Publishing, New York, NY, 2017. 133 pp. Type: Book (978-3-319607-91-7)
If someone has a set of objects whose positions are known, calculating the distances between them is not a problem. However, the inverse problem is difficult, that is, given a set of distances between objects, determine their positions. Unfortunat...
May 14 2019
Guide to graph algorithms: sequential, parallel and distributed
Erciyes K., Springer International Publishing, New York, NY, 2018. 471 pp. Type: Book (978-3-319732-34-3)
This comprehensive text focuses on graph data structures and consequent graph algorithms as fundamental to the analysis of various types of networks, from social to biological ones. The book consists of three parts, with 15 chapters including an e...
Jan 22 2019
Hitting forbidden subgraphs in graphs of bounded treewidth
Cygan M., Marx D., Pilipczuk M., Pilipczuk M. Information and Computation 256(C): 62-82, 2017. Type: Article
For a given linear transform
over a given vector space
starting at point
, the orbit of
is an infinite sequence (
Jul 23 2018
Gunrock: GPU graph analytics
Wang Y., Pan Y., Davidson A., Wu Y., Yang C., Wang L., Osama M., Yuan C., Liu W., Riffel A., Owens J. ACM Transactions on Parallel Computing 4(1): 1-49, 2017. Type: Article
Graphs are fundamental data structures for modeling social interactions, computer networks, and physical simulations. Graph analytic libraries provide optimized primitives and application programming interfaces (APIs) for performing computation on...
Nov 30 2017
A maximum flow algorithm based on storage time aggregated graph for delay-tolerant networks
Li H., Zhang T., Zhang Y., Wang K., Li J. Ad Hoc Networks 59(C): 63-70, 2017. Type: Article
Searching for maximum flow in a network based on graph theory is essential in planning the route and scheduling transmission. Therefore, it is natural to study the maximum flow on various types of networks. While traditional maximum flow algorithm...
May 26 2017
Handbook of graph theory, combinatorial optimization, and algorithms
Thulasiraman K., Nishizeki T., Arumugam S., Brandstädt A., Chapman & Hall/CRC, Boca Raton, FL, 2016. 1216 pp. Type: Book (978-1-584885-95-5)
This huge volume has 44 chapters written by more than 40 experts worldwide. The text focuses on the synergy between graph theory and combinatorial optimization, plus algorithms as a vehicle for practical implementation. That format is a bit unique...
Apr 12 2017
On multiaspect graphs
Wehmuth K., Fleury É., Ziviani A. Theoretical Computer Science 651(C): 50-61, 2016. Type: Article
Many application domains require generalizations of the classical definition of directed graphs, for example, systems whose structures evolve over time (time-varying networks); systems that can be represented as conjunctions of interdependent netw...
Mar 1 2017
Parameterized complexity of critical node cuts
Hermelin D., Kaspi M., Komusiewicz C., Navon B. Theoretical Computer Science 651(C): 62-75, 2016. Type: Article
The critical node cut (CNC) problem is defined as follows: given an (undirected) graph
and two integers
, decide if
nodes can be removed from
Feb 13 2017
Nonlinear Laplacian for digraphs and its applications to network analysis
Yoshida Y. WSDM 2016 (Proceedings of the 9th ACM International Conference on Web Search and Data Mining, San Francisco, CA, Feb 22-25, 2016) 483-492, 2016. Type: Proceedings
This paper relates to spectral graph theory and more specifically concerns the case of digraphs, directed graphs. It proposes an alternative framework to existing digraph approaches, such as Chung’s, or the Diplacian, relying on stationary p...
Jul 28 2016
Reproduction in whole or in part without permission is prohibited. Copyright © 2000-2021 ThinkLoud, Inc.