We present a method to find static path exclusions in a control flow graph in order to refine the WCET analysis. Using this information, some infeasible paths can be discarded ...
Let M denote the Laplacian matrix of a graph G. Associated with G is a finite group (G), obtained from the Smith normal form of M, and whose order is the number of spanning trees o...
We propose two alternative measures of the local irregularity of a graph in terms of its vertex degrees and relate these measures to the order and the global irregularity of the g...
The lattice of noncrossing partitions can be embedded into the Cayley graph of the symmetric group. This allows us to rederive connections between noncrossing partitions and parki...
We present a framework for approximating the metric TSP based on a novel use of matchings. Traditionally, matchings have been used to add edges in order to make a given graph Eule...