In the precoloring extension problem (PrExt) a graph is given with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to...
: Several web sites and e-learning platforms require the access to graphs that carry significant meanings. Understanding and perceiving the graph of a mathematical function is impo...
Efficient performance tuning of parallel programs is often hard. In this paper we describe an approach that uses a uni-processor execution of a multithreaded program as reference ...
Graph transformations are one of the best known approaches for defining transformations in model-based software development. They are defined over the abstract syntax of source and...
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad...