Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Mathematics Of Computing (G) > Discrete Mathematics (G.2) > Graph Theory (G.2.2) > Graph Algorithms (G.2.2...)  
 
Options:
 
  1-10 of 319 Reviews about "Graph Algorithms (G.2.2...)": Date Reviewed
  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 G and two integers k and x, decide if k nodes can be removed from G
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
  A guide to graph colouring: algorithms and applications
Lewis R.,  Springer International Publishing, New York, NY, 2015. 253 pp. Type: Book (978-3-319257-28-0)

Graph coloring is an active field of research that poses many theoretical challenges and has lots of applications in practice. Numerous problems in graph coloring are quite easy to state, but very difficult to prove. A typical example is the probl...

Jun 22 2016
  Efficient and effective community search
Barbieri N., Bonchi F., Galimberti E., Gullo F.  Data Mining and Knowledge Discovery 29(5): 1406-1433, 2015. Type: Article

The problem discussed in this paper is in fact linked to social media and network research. Social media, as it is well known, offers opportunities for commerce and other business activities. The paper refers to examples in advertising, viral mark...

Jan 20 2016
  Experiments on density-constrained graph clustering
Görke R., Kappes A., Wagner D.  Journal of Experimental Algorithmics 191.1-1.31, 2015. Type: Article

Graph clustering is the task of identifying dense sub-graphs of a given graph such that these sub-graphs are sparsely interconnected. In this paper, the authors conduct an experimental evaluation of greedy graph clustering algorithms. First, the p...

Sep 8 2015
  The (weighted) metric dimension of graphs: hard and easy cases
Epstein L., Levin A., Woeginger G.  Algorithmica 72(4): 1130-1171, 2015. Type: Article

Metric dimension (MD) optimization algorithms require computation in such areas as network verification, mastermind games, metric and digital geometry, image digitization, robot navigation, drug discovery, and combinatorics problems. The authors t...

Aug 31 2015
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2017 ThinkLoud, Inc.
Terms of Use
| Privacy Policy