Real networks exhibit heterogeneous nature with nodes playing far different roles in
structure and function. To identify vital nodes is thus very significant, allowing us to control …

"" Presents the latest in graph domination by leading researchers from around the world-
furnishing known results, open research problems, and proof techniques. Maintains …

The fast increase of 'multi-omics' data does not only pose a computational challenge for its
analysis but also requires novel algorithmic methodologies to identify complex biological …

While concepts related to domination in graphs can be traced back to the Roman Empire in
the fourth century AD and to the mid-1800s in connection with various chessboard problems …

This newly expanded and updated second edition of the best-selling classic continues to
take the" mystery" out of designing algorithms, and analyzing their efficacy and efficiency …

Learn all you need to know about wireless sensor networks! Protocols and Architectures for
Wireless Sensor Networks provides a thorough description of the nuts and bolts of wireless …

When dealing with special graph classes and algorithmic problems on them, a main source
is the classical book of Golumbic, Algorithmic Graph Theory and Perfect Graphs [454]. The …

Graph theory experienced a tremendous growth in the 20th century. One of the main
reasons for this phenomenon is the applicability of graph theory in other disciplines such as …

A Roman dominating function on a graph G=(V, E) is a function f: V→{0, 1, 2} satisfying the
condition that every vertex u for which f (u)= 0 is adjacent to at least one vertex v for which f …

With Chromatic Graph Theory, Second Edition, the authors present various fundamentals of
graph theory that lie outside of graph colorings, including basic terminology and results …