Search for Topics All Reviews
	Browse All Reviews > Mathematics Of Computing (G) > Discrete Mathematics (G.2) > Graph Theory (G.2.2) > Graph Algorithms (G.2.2...)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 136 Reviews about "Graph Algorithms (G.2.2...)": Date Reviewed   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 a... Jul 10 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 in... Jan 22 2019   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 ... 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 interde... 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 Feb 13 2017   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 ... Jun 22 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. ... Sep 8 2015   Improving multiple aesthetics produces better graph drawings Huang W., Eades P., Hong S., Lin C. Journal of Visual Languages and Computing 24(4): 262-272, 2013.  Type: Article Since many aesthetic constraints are conflicting in nature, graph-drawing algorithms generally tend to optimize one or two constraints to the fullest. This paper introduces a new graph-drawing algorithm called BIGANGLE, which is built ... Nov 20 2013    Comparing paper ranking algorithms Dunaiski M., Visser W.  SAICSIT 2012 (Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference, Pretoria, South Africa, Oct 1-3, 2012) 21-30, 2012.  Type: Proceedings Paper rankings are becoming increasingly important to those in the scientific community, who use these measures to get an overall idea of the impact of their research. More importantly, their use is widespread on Web sites that use cit... Dec 27 2012   Online multi-robot exploration of grid graphs with rectangular obstacles Ortolf C., Schindelhauer C.  SPAA 2012 (Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, Pittsburgh, PA, Jun 25-27, 2012) 27-36, 2012.  Type: Proceedings In this research paper, the authors consider planar sceneries as an approach to the problem of multi-robot exploration of an unknown n x n grid graph with oriented disjoint rectangular obstacles. M... Nov 12 2012       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy