Zobrazeno 1 - 10
of 62
pro vyhledávání: '"Spinrad, Jeremy P."'
Autor:
Joveski, Zlatko, Spinrad, Jeremy P.
In this work, we introduce the \emph{interval permutation segment (IP-SEG)} model that naturally generalizes the geometric intersection models of interval and permutation graphs. We study properties of two graph classes that arise from the IP-SEG mod
Externí odkaz:
http://arxiv.org/abs/1908.10491
A semiorder is a model of preference relations where each element $x$ is associated with a utility value $\alpha(x)$, and there is a threshold $t$ such that $y$ is preferred to $x$ iff $\alpha(y) > \alpha(x)+t$. These are motivated by the notion that
Externí odkaz:
http://arxiv.org/abs/1702.06614
Autor:
Curtis, Andrew R., Lin, Min Chih, McConnell, Ross M., Nussbaum, Yahav, Soulignac, Francisco J., Spinrad, Jeremy P., Szwarcfiter, Jayme L.
Publikováno v:
Discrete Math. Theor. Comput. Sci. 15 (2013), 157--182
We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. This algorithm leads to linear-time isomorphism algorithms for related graph classes, including Helly circular-arc graphs, \Gam
Externí odkaz:
http://arxiv.org/abs/1203.4822
Deciding whether an arbitrary graph contains a sun was recently shown to be NP-complete. We show that whether a building-free graph contains a sun can be decided in O(min$\{m{n^3}, m^{1.5}n^2\}$) time and, if a sun exists, it can be found in the same
Externí odkaz:
http://arxiv.org/abs/0910.1808
We consider the class of (C4, diamond)-free graphs; graphs in this class do not contain a C4 or a diamond as an induced subgraph. We provide an efficient recognition algorithm for this class. We count the number of maximal cliques in a (C4, diamond)-
Externí odkaz:
http://arxiv.org/abs/0909.4719
Autor:
Golovach, Petr A., Heggernes, Pinar, Lindzey, Nathan, McConnell, Ross M., dos Santos, Vinícius Fernandes, Spinrad, Jeremy P., Szwarcfiter, Jayme Luiz
Publikováno v:
In Discrete Applied Mathematics 10 January 2017 216 Part 1:171-180
A semiorder is a model of preference relations where each element x is associated with a utility value alpha(x), and there is a threshold t such that y is preferred to x iff alpha(y) - alpha(x) > t. These are motivated by the notion that there is som
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cc65d34c9c61df91c68aafda9ba374ad
Autor:
Raghavan, Vijay, Spinrad, Jeremy P.
Publikováno v:
In Electronic Notes in Discrete Mathematics 2000 5:266-269