Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

IWOCA

2010

Springer

2010

Springer

A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-role assignment of G. Role assignments have applications in distributed computing, social network theory, and topological graph theory. The Role Assignment problem has as input a pair of graphs (G, R) and asks whether G has an R-role assignment. This problem is NP-complete already on input pairs (G, R) where R is a path on three vertices. So far, the only known non-trivial tractable case consists of input pairs (G, R) where G is a tree. We present a polynomial time algorithm that solves Role Assignment on all input pairs (G, R) where G is a proper interval graph. Thus we identify the first graph class other than trees on which the problem is tractable. As a complementary result, we show that the problem is Graph Isomorphism-hard on chordal graphs, a superclass of proper interval graphs and trees.

Added |
19 May 2011 |

Updated |
19 May 2011 |

Type |
Journal |

Year |
2010 |

Where |
IWOCA |

Authors |
Pinar Heggernes, Pim van 't Hof, Daniël Paulusma |

Comments (0)