In this paper, we propose a new neighborhood structure based on the improvement graph for solving the Robust Graph Coloring Problem, an interesting extension of classical graph col...
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
In this paper, we consider an arbitrary class H of rooted graphs such that each biconnected component is given by a representation with reflectional symmetry, which allows a roote...
—p-Cycles have been proposed for preprovisioned 1 : N protection in optical mesh networks. Although the protection circuits are preconfigured, the detection of failures and the ...
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...