Results 161 to 170 of about 952,460 (194)

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

open access: yesAntimicrob Agents Chemother
Jia Y   +9 more
europepmc   +1 more source

Validating the Chinese version of the Apathy Motivation Index and network analysis of apathy subtypes in a healthy Chinese sample. [PDF]

open access: yesBehav Res Methods
Zhao X   +12 more
europepmc   +1 more source

Trajectories of Adherence to Biologics in Patients With Inflammatory Bowel Diseases: A Large-Scale Multi-Regional Italian Study Through the VALORE Distributed Database. [PDF]

open access: yesPharmacoepidemiol Drug Saf
Giometto S   +34 more
europepmc   +1 more source

A characterization of P4‐indifference graphs

open access: closedJournal 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\).
Hoàng, Chính T.   +2 more
semanticscholar   +6 more sources

Double Semiorders and Double Indifference Graphs

open access: closedSIAM 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.
Cozzens, Margaret B., Roberts, Fred S.
semanticscholar   +4 more sources

Edge Colouring Reduced Indifference Graphs

open access: closedLatin 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   +2 more
semanticscholar   +3 more sources

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

open access: closedWorkshop 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.
Bodlaender, H.L.   +4 more
semanticscholar   +4 more sources

Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders

open access: closedSIAM 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\).
Sen, M., Sanyal, B. K.
openaire   +3 more sources

Home - About - Disclaimer - Privacy