882 search results - page 78 / 177 » On the Hardness of Graph Isomorphism |
IWPEC
2004
Springer
15 years 5 months ago
2004
Springer
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...
107
click to vote
CVHI
2007
15 years 1 months ago
2007
: 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...
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
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 ...
108
click to vote
ERSHOV
2006
Springer
15 years 1 months ago
2006
Springer
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...
APPROX
2007
Springer
15 years 6 months ago
2007
Springer
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 ...