In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prov...
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost ed...
To produce high quality drawings of graphs with nodes drawn as shapes it is important to find routes for the edges which do not intersect node boundaries. Recent work in this area...
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...