A cycle \(\mathscr{C}\) in a graph G is called extendable if there is another cycle in G which contains all the vertices of \(\mathscr{C}\) and exactly one other vertex. A graph G is cycle-extendable ...

Graph coloring-in a generic sense-is used to identify subsets of independent tasks in parallel scientific computing applications. Traditional coloring heuristics aim to reduce the number of colors ...

Graph partitioning is a well-known NP-hard problem that has no known efficient algorithm. Given its practical importance, many heuristic algorithms have been proposed. One example is METIS, a k-way ...

Graph coloring-in a generic sense-is used to identify subsets of independent tasks in parallel scientific computing applications. Traditional coloring heuristics aim to reduce the number of colors ...