13 search results - page 1 / 3 » Computing Role Assignments of Chordal Graphs |
FCT
2009
Springer
13 years 11 months ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
IWOCA
2010
Springer
12 years 11 months ago
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-r...
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
Standard methods for role assignment partition the vertex set of a graph in such a way that vertices in the same class can be considered to have equivalent roles in the graph. Seve...
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
ACIVS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In the pattern recognition context, objects can be represented as graphs with attributed nodes and edges involving their relations. Consequently, matching attributed grap...