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
 
Naduvath, Sudev
Christ (Deemed to be University)
Bengaluru, India
 
   Reader Recommended
   Reviewer Selected
Follow this Reviewer
 
 
 
Options:
Date Reviewed  
 
1
- 10 of 14 reviews

   
  Recognizing weak embeddings of graphs
Akitaya H., Fulek R., Tóth C. ACM Transactions on Algorithms 15(4): 1-27, 2019.  Type: Article

The paper begins:...

Mar 12 2021  
  Exact transversal hypergraphs and application to Boolean &mgr;-functions
Eiter T. Journal of Symbolic Computation 17(3): 215-225, 1994.  Type: Article, Reviews: (2 of 2)

A hypergraph is a generalized structure of a graph in which an edge, called a hyperedge, can have more than two vertices. A subset T is said to be a transversal of a given hypergraph if it intersects every (non-empty...

Nov 26 2020  
   Generating functions in engineering and the applied sciences
Chattamvelli R., Shanmugam R., Morgan&Claypool Publishers, San Rafael, CA, 2019. 112 pp.  Type: Book (978-1-681736-38-9)

A generating function is an algebraic function that represents a given sequence and the corresponding power series. Generating functions play a vital role in the area of enumerative combinatorics as an effective tool for determining di...

Mar 9 2020  
  Community search over big graphs
Huang X., Lakshmanan L., Xu J., Morgan&Claypool Publishers, San Rafael, CA, 2019. 208 pp.  Type: Book (978-1-681735-95-5)

Community structures exist normally in numerous real-world networks. Social, biological, and communication networks are some examples of community structures. In the first chapter of the book, the authors discuss some applications for ...

Dec 19 2019  
   Graph theory and its applications (3rd ed.)
Gross J., Yellen J., Anderson M., Chapman&Hall/CRC, Boca Raton, FL, 2018. 591 pp.  Type: Book (978-1-482249-48-4)

Graph theory is one of the most fertile and popular domains in current mathematics research. This is mainly because graphs can be used as coherent models for many problems across almost all disciplines. This book can be viewed as effec...

Oct 23 2019  
  Induced minor free graphs: isomorphism and clique-width
Belmonte R., Otachi Y., Schweitzer P. Algorithmica 80(1): 29-47, 2018.  Type: Article

A graph H is said to be an induced minor of another graph G “if a graph isomorphic to H can be [constructed] from G by a sequence of vertex deletions...

Apr 2 2019  
   Quantitative graph theory
Dehmer M., Emmert-Streib F., Shi Y. Information Sciences 418(C): 575-580, 2017.  Type: Article

In this paper, the authors provide a description of quantitative graph theory, which is a relatively new branch of graph theory. The key feature of this branch is its measurement approach to quantifying the structural information of ne...

Mar 14 2019  
   Minimal equivalent subgraphs containing a given set of arcs
Reimers A., Reimers A., Goldstein Y. Theoretical Computer Science 67556-63, 2017.  Type: Article

A preordered set (V,→) is a set V with a binary relation → that satisfies reflexivity and transitivity. A directed graph (digraph) D=(V,
Nov 19 2018  
   Fuzzy graph theory
Mathew S., Mordeson J., Malik D., Springer International Publishing, Cham, Switzerland, 2018. 320 pp.  Type: Book (978-3-319714-06-6)

Fuzzy graph theory is a recently developed field, and thus many research opportunities exist. This book is a very good and suitable option for readers who wish to either begin or continue their studies in different areas of fuzzy graph...

Aug 24 2018  
   Large induced forests in graphs
Shi L., Xu H. Journal of Graph Theory 85(4): 759-779, 2017.  Type: Article

A subset S of the vertex set of a given graph G is acyclic if the subgraph of G induced by S does not consist of any cycle. The maximum order of such an acycli...

Jul 30 2018  
 
 
 
Display per column
 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy