Results 151 to 159 of about 35,279 (159)

Counting and enumerating unlabeled split–indifference graphs

Discrete Mathematics, Algorithms and Applications, 2017
We present in this paper a code for the class of unlabeled split–indifference graphs. This codification allows us to establish the exact number of elements of the class up to isomorphism. In order to obtain this result, structural properties of the class are explored, including a new approach for the characterization theorem.
Lilian Markenzon, Christina F. E. M. Waga   +1 more
openalex   +3 more sources

Pairwise Partition Graphs and Strategy-proof Social Choice in the Exogenous Indifference Class Model [PDF]

, 2014
In this paper we consider the exogenous indifference classes model of Barberá and Ehlers (2011) and Sato (2009) and analyze further the relationship between the structure of indifference classes across agents and dictatorship results.
Anup Pramanik, Arunava Sen
core   +2 more sources

GREEDY RECOGNITION AND COLORING ALGORITHMS FOR INDIFFERENCE GRAPHS

, 1992
P. Looges, Stephan Olariu
openalex   +2 more sources

The Total Chromatic Number of Reduced Indifference Graphs is the Maximum Degree Plus One

Sheila Morais de Almeida, Celina M.H. de Figueiredo, Diana Sasaki   +2 more
openalex   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Role primitive indifference graphs and role assignments on \(w\)-fan graphs

Summary: A \(k\)-role assignment of a graph is an assignment of a role, using one of \(k\) roles, to every vertex such that vertices with the same role will have the same neighboring roles as well. The idea has its motivation in social network theory, where one tries to define social roles so that if two individuals get the same social role, they ...
Roberts, Fred S., Sheng, Li
openaire   +1 more source

Single row routing with indifference graphs on the distributed array processor

Summary: The Distributed Array of Processors ( DAP) is a commercially available massively parallel machine which is often applied to numerical intensive problems that exploit its matrix manipulation abilities. The purpose of this work is to show that the DAP can also be efficiently used to solve non-numerical problems.
Chennapragada, D., Looges, P., Olariu, S.   +2 more
openaire   +1 more source

Edge-colouring of indifference graphs

, 1994
Mello Cp, João Meidânis, Figueiredo Cmh   +2 more
openalex  

On interval and indifference graphs [PDF]

Mathematical Reports, 2017
openaire  

Single row routing with indifference graphs on the distributed array processor

, 1992
D. Chennapragada, P. Looges, Stephan Olariu   +2 more
openalex