The graph isomorphism problem—to devise a good algorithm for determining if two graphs
are isomorphic—is of considerable practical importance, and is also of theoretical interest …

Although the theory of random graphs is one of the youngest branches of graph theory, in
importance it is second to none. It began with some sporadic papers of Erdős in the 1940s …

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 …

A recent paper posed the question:" Graph Matching: What are we really talking about?". Far
from providing a definite answer to that question, in this paper we will try to characterize the …

We consider the problem of exact and inexact matching of weighted undirected graphs, in
which a bijective correspondence is sought to minimize a quadratic weight disagreement …

'Network'is a heavily overloaded term, so that 'network analysis' means different things to
different people. Specific forms of network analysis are used in the study of diverse …

In this paper we study the family of graphs which can be reduced to single vertices by
recursively complementing all connected subgraphs. It is shown that these graphs can be …

In recent years, the use of graph based object representation has gained popularity.
Simultaneously, graph edit distance emerged as a powerful and flexible graph matching …

Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and
Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to …

In array processors it is important to map problem modules onto processors such that
modules that communicate with each other lie, as far as possible, on adjacent processors …