Results 161 to 170 of about 1,013,923 (195)

Comparing clinical features of behavioral variant frontotemporal dementia and Alzheimer's disease using network analysis. [PDF]

Alzheimers Dement
Goodwin GJ, Mehrzad S, Cummings JL, Renn BN, Kinney JW, John SE.   +5 more
europepmc   +1 more source

Generalization across dimensions: A model for three-alternative choice. [PDF]

J Exp Anal Behav
Davison M, Cowie S.
europepmc   +1 more source

An enoyl-ACP reductase inhibitor, NITD-916, expresses anti-<i>Mycobacterium abscessus</i> activity. [PDF]

Antimicrob Agents Chemother
Jia Y, Fan J, Tan Z, Li A, He S, Lin Y, Li J, Zhang Z, Li B, Chu H.   +9 more
europepmc   +1 more source

A characterization ofP4-indifference graphs

Journal of Graph Theory, 1999
Summary: A graph is a \(P_4\)-indifference graph if it admits a linear ordering \(\prec\) on its vertices such that every chordless path with vertices \(a\), \(b\), \(c\), \(d\) and edges \(ab\), \(bc\), \(cd\) has either \(a\prec b\prec c\prec d\) or \(d\prec c\prec b\prec a\).
Chı́nh T. Hoàng, Frédéric Maffray, Marc Noy   +2 more
semanticscholar   +6 more sources

Vector Domination in split-indifference graphs

Information Processing Letters, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rodrigo Lamblet Mafort, Fábio Protti
semanticscholar   +3 more sources

Double Semiorders and Double Indifference Graphs

SIAM Journal on Algebraic Discrete Methods, 1982
The notion of semiorder was introduced by Luce in 1956 as a model for preference in the situation where indifference judgments are nontransitive. The notion of indifference graph was introduced by Roberts in 1968 as a model for nontransitive indifference.
Margaret B. Cozzens, Fred S. Roberts
semanticscholar   +4 more sources

Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P 4’s

Workshop on Engineering Applications, 2004
The simple max-cut problem is as follows: given a graph, find a partition of its vertex set into two disjoint sets, such that the number of edges having one endpoint in each set is as large as possible. A split graph is a graph whose vertex set admits a partition into a stable set and a clique.
Hans L. Bodlaender, Celina M.H. de Figueiredo, Marisa Gutiérrez, Ton Kloks, Rolf Niedermeier   +4 more
semanticscholar   +4 more sources

Edge Colouring Reduced Indifference Graphs

Latin American Symposium on Theoretical Informatics, 2000
The chromatic index problem – finding the minimum number of colours required for colouring the edges of a graph – is still unsolved for indifference graphs, whose vertices can be linearly ordered so that the vertices contained in the same maximal clique are consecutive in this order.
Celina M.H. de Figueiredo, Célia Picinin de Mello, Carmen Ortiz   +2 more
semanticscholar   +3 more sources

Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders

SIAM Journal on Discrete Mathematics, 1994
The authors extend the notion of indifference graphs to digraphs. A digraph with edge set \(E\) is an indifference digraph if there exists an ordered pair of real valued functions \(f\), \(g\) on the vertices \(u\), \(v\) satisfying \(uv\in E\) if and only if \(| f(u)- g(v)|\leq 1\).
M. K. Sen, Barum K. Sanyal
openalex   +3 more sources

Gridline indifference graphs

Mathematical Social Sciences, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dale Peterson
openalex   +2 more sources