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 Theory (G.2.2) See Reviews  
 
Subject Descriptors:
Graph Algorithms (318)
Graph Labeling (16)
Hypergraphs (13)
Network Problems (158)
Path And Circuit Problems (73)
Trees (138)
 
Proper Nouns:
There are no proper nouns with reviews under G.2.2.
 
 
Reviews limited to:
 
 

Reviews about "Graph Theory (G.2.2)":
Basic graph theory
Rahman M.,  Springer International Publishing, New York, NY, 2017. 169 pp. Type: Book (978-3-319494-74-6)
Trends in social network analysis: information propagation, user behavior modeling, forecasting, and vulnerability assessment
Missaoui R., Abdessalem T., Latapy M.,  Springer International Publishing, New York, NY, 2017. 255 pp. Type: Book (978-3-319534-19-0)
Random graphs and complex networks: volume one
van der Hofstad R.,  Cambridge University Press, New York, NY, 2016. 375 pp. Type: Book (978-1-107172-87-6)
Interactive web-based visualization for accessibility mapping of transportation networks
Schoedon A., Trapp M., Hollburg H., Döllner J.  EuroVis 2016 (Proceedings of the Eurographics/IEEE VGTC Conference on Visualization, Groningen, the Netherlands,  Jun 6-10, 2016) 79-83, 2016. Type: Proceedings
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)
On multiaspect graphs
Wehmuth K., Fleury É., Ziviani A.  Theoretical Computer Science 651(C): 50-61, 2016. Type: Article
Parameterized complexity of critical node cuts
Hermelin D., Kaspi M., Komusiewicz C., Navon B.  Theoretical Computer Science 651(C): 62-75, 2016. Type: Article
more...
Related Topics
G.2.2 Graph Theory
  - Nonnumerical Algorithms And Problems
   
 
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